diff options
Diffstat (limited to 'share/pretty-printers/stlport')
| -rw-r--r-- | share/pretty-printers/stlport/COPYING | 676 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/ChangeLog | 14 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/README | 43 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/stlport/__init__.py | 1 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/stlport/printers.py | 727 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/test/.gdbinit | 12 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/test/Makefile | 117 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/test/script | 41 | ||||
| -rw-r--r-- | share/pretty-printers/stlport/test/test.cpp | 181 |
9 files changed, 0 insertions, 1812 deletions
diff --git a/share/pretty-printers/stlport/COPYING b/share/pretty-printers/stlport/COPYING deleted file mode 100644 index 4432540..0000000 --- a/share/pretty-printers/stlport/COPYING +++ /dev/null @@ -1,676 +0,0 @@ - - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> - 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. - - <one line to give the program's name and a brief idea of what it does.> - Copyright (C) <year> <name of author> - - 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 <http://www.gnu.org/licenses/>. - -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: - - <program> Copyright (C) <year> <name of author> - 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 -<http://www.gnu.org/licenses/>. - - 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 -<http://www.gnu.org/philosophy/why-not-lgpl.html>. - diff --git a/share/pretty-printers/stlport/ChangeLog b/share/pretty-printers/stlport/ChangeLog deleted file mode 100644 index 79fe161..0000000 --- a/share/pretty-printers/stlport/ChangeLog +++ /dev/null @@ -1,14 +0,0 @@ -gppfs (0.2) - - * Add support for std::tr1::unordered_{multi,}{map,set}, std::auto_ptr, - std::tr1::shared_ptr and std::tr1::weak_ptr. - * Fix display of empty strings with STLport 5.0.x if - _STLP_FORCE_STRING_TERMINATION is not enabled. - - -- Joachim Reichel <joachim.reichel@gmx.de> Mon, 04 Oct 2010 20:10:14 +0200 - -gppfs (0.1) - - * Initial release. - - -- Joachim Reichel <joachim.reichel@gmx.de> Thu, 30 Sep 2010 18:40:42 +0200 diff --git a/share/pretty-printers/stlport/README b/share/pretty-printers/stlport/README deleted file mode 100644 index 56f18c6..0000000 --- a/share/pretty-printers/stlport/README +++ /dev/null @@ -1,43 +0,0 @@ -GDB pretty printers for STLport -=============================== - -This python module provides GDB pretty printers for the containers from -STLport. It is based on a similar python module for libstdc++ [1]. It has -been tested with GDB 7.0.1/7.2 and STLport 4.6.2/5.0.3/5.1.7/5.2.1. - -[1] svn://gcc.gnu.org/svn/gcc/trunk/libstdc++-v3/python - - -Installation ------------- - -To install the python module copy the "stlport" subdirectory to some place. -To enable the pretty printer add the following code to $HOME/.gdbinit: - - python - import sys - - sys.path.insert (0, '/path/to/dir/containing/the/stlport/dir') - import stlport.printers - stlport.printers.register_stlport_printers (None) - - # see the python module for a description of these options - # stlport.printers.stlport_version = 5.2 - # stlport.printers.print_vector_with_indices = False - - end - - -Testing -------- - -To test the pretty printers, go to the test directory and set up the STLport -directory in the Makefile. Calling make should then compile two executables -(with and without -D_STLP_DEBUG) and invoke GDB with the supplied script. If -the pretty printers work the variables from test.cpp should be displayed in a -convenient way. - -Note that GDB prefers python modules from $HOME/.gdbinit over those from -.gdbinit in the current working directory. If you adapted $HOME/.gdbinit as -described above the location there will be used. Otherwise, test/.gdbinit will -load stlport/printers.py. diff --git a/share/pretty-printers/stlport/stlport/__init__.py b/share/pretty-printers/stlport/stlport/__init__.py deleted file mode 100644 index 8b13789..0000000 --- a/share/pretty-printers/stlport/stlport/__init__.py +++ /dev/null @@ -1 +0,0 @@ - diff --git a/share/pretty-printers/stlport/stlport/printers.py b/share/pretty-printers/stlport/stlport/printers.py deleted file mode 100644 index 282e62c..0000000 --- a/share/pretty-printers/stlport/stlport/printers.py +++ /dev/null @@ -1,727 +0,0 @@ -# GDB pretty printers for STLport. -# -# Copyright (C) 2008, 2009, 2010 Free Software Foundation, Inc. -# Copyright (C) 2010 Joachim Reichel -# -# 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 <http://www.gnu.org/licenses/>. - - -# pylint: disable=C0103,C0111,R0201,R0903 - - -import gdb -import re - - -# Set the STLport version which is needed for a few features. -# -# - for std::list: -# STLport older than 5.0? -# - for std::deque, std::stack, and std::queue on 64bit systems: -# STLport older than 5.2? -stlport_version = 5.2 - -# Indicates whether std::vector is printed with indices. -print_vector_with_indices = False - - -def lookup_stlport_type (typename): - "Look up a type in the public STLport namespace." - - namespaces = ['std::', 'stlpd_std::', 'stlp_std::', '_STL::'] - for namespace in namespaces: - try: - return gdb.lookup_type (namespace + typename) - except RuntimeError: - pass - -def lookup_stlport_priv_type (typename): - "Look up a type in the private STLport namespace." - - namespaces = ['std::priv::', 'stlpd_std::priv::', 'stlp_priv::', 'stlp_std::priv::', - 'stlpd_std::', 'stlp_std::', '_STL::'] - for namespace in namespaces: - try: - return gdb.lookup_type (namespace + typename) - except RuntimeError: - pass - - -def get_non_debug_impl (value, member = None): - "Return the non-debug implementation of value or value[member]." - if member: - value = value[member] - try: - return value['_M_non_dbg_impl'] - except RuntimeError: - return value - - -class RbtreeIterator: - - def __init__ (self, rbtree): - tree = get_non_debug_impl (rbtree , '_M_t') - self.size = tree['_M_node_count'] - self.node = tree['_M_header']['_M_data']['_M_left'] - self.count = 0 - - def __iter__ (self): - return self - - def __len__ (self): - return int (self.size) - - def next (self): - if self.count == self.size: - raise StopIteration - result = self.node - self.count += 1 - if self.count < self.size: - node = self.node - # Is there a right child? - if node.dereference()['_M_right']: - # Walk down to left-most child in right subtree. - node = node.dereference()['_M_right'] - while node.dereference()['_M_left']: - node = node.dereference()['_M_left'] - else: - # Walk up to first parent reached via left subtree. - parent = node.dereference()['_M_parent'] - while node == parent.dereference()['_M_right']: - node = parent - parent = parent.dereference()['_M_parent'] - node = parent - self.node = node - return result - - -class BitsetPrinter: - "Pretty printer for std::bitset." - - def __init__(self, typename, val): - self.typename = typename - self.val = val - - def to_string (self): - # If template_argument handled values, we could print the - # size. Or we could use a regexp on the type. - return '%s' % (self.typename) - - def children (self): - words = self.val['_M_w'] - - # The _M_w member can be either an unsigned long, or an - # array. This depends on the template specialization used. - # If it is a single long, convert to a single element list. - if words.type.code == gdb.TYPE_CODE_ARRAY: - word_size = words.type.target ().sizeof - n_words = words.type.sizeof / word_size - else: - word_size = words.type.sizeof - n_words = 1 - words = [words] - - result = [] - word = 0 - while word < n_words: - w = words[word] - bit = 0 - while w != 0: - if w & 1: - result.append (('[%d]' % (word * word_size * 8 + bit), 1)) - bit += 1 - w = w >> 1 - word += 1 - return result - - -class DequePrinter: - "Pretty printer for std::deque." - - class Iterator: - def __init__ (self, start_node, start_cur, start_last, - finish_cur, buffer_size): - self.node = start_node - self.item = start_cur - self.node_last = start_last - self.last = finish_cur - self.buffer_size = buffer_size - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.item == self.last: - raise StopIteration - result = ('[%d]' % self.count, self.item.dereference()) - self.count += 1 - self.item += 1 - if self.item == self.node_last: - self.node += 1 - self.item = self.node[0] - self.node_last = self.item + self.buffer_size - return result - - def __init__ (self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - size = val.type.template_argument(0).sizeof - # see MAX_BYTES in stlport/stl/_alloc.h - if stlport_version < 5.2: - blocksize = 128 - else: - blocksize = 32 * gdb.lookup_type ("void").pointer().sizeof - if size < blocksize: - self.buffer_size = int (blocksize / size) - else: - self.buffer_size = 1 - - def to_string (self): - start = self.val['_M_start'] - finish = self.val['_M_finish'] - delta_n = finish['_M_node'] - start['_M_node'] - 1 - delta_s = start['_M_last'] - start['_M_cur'] - delta_f = finish['_M_cur'] - finish['_M_first'] - if delta_n == -1: - size = delta_f - else: - size = self.buffer_size * delta_n + delta_s + delta_f - ta0 = self.val.type.template_argument (0) - return '%s<%s> with %d elements' % (self.typename, ta0, int (size)) - - def children (self): - start = self.val['_M_start'] - finish = self.val['_M_finish'] - return self.Iterator (start['_M_node'], start['_M_cur'], - start['_M_last'], finish['_M_cur'], self.buffer_size) - - def display_hint (self): - return 'array' - - -class ListPrinter: - "Pretty printer for std::list." - - class Iterator: - def __init__ (self, node_type, head): - self.node_type = node_type - # see empty() in stlport/stl/_list.h - if stlport_version < 5.0: - self.sentinel = head - else: - self.sentinel = head.address - self.item = head['_M_next'] - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.item == self.sentinel: - raise StopIteration - node = self.item.cast (self.node_type).dereference() - self.item = node['_M_next'] - count = self.count - self.count += 1 - return ('[%d]' % count, node['_M_data']) - - def __init__(self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - - def children (self): - ta0 = self.val.type.template_argument(0) - node_type = lookup_stlport_priv_type ('_List_node<%s>' % ta0).pointer() - return self.Iterator (node_type, self.val['_M_node']['_M_data']) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - # see empty() in stlport/stl/_list.h - if stlport_version < 5.0: - sentinel = self.val['_M_node']['_M_data'] - else: - sentinel = self.val['_M_node']['_M_data'].address - if self.val['_M_node']['_M_data']['_M_next'] == sentinel: - return 'empty %s<%s>' % (self.typename, ta0) - return '%s<%s>' % (self.typename, ta0) - - def display_hint (self): - return 'array' - - -class MapPrinter: - "Pretty printer for std::map and std::multimap." - - class Iterator: - - def __init__ (self, rbiter, node_type): - self.rbiter = rbiter - self.node_type = node_type - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.count % 2 == 0: - item = self.rbiter.next().dereference() - self.pair = (item.cast (self.node_type))['_M_value_field'] - element = self.pair['first'] - else: - element = self.pair['second'] - count = self.count - self.count += 1 - return ('[%d]' % count, element) - - def __init__ (self, typename, val): - self.typename = typename - self.val = val - - def children (self): - key_type = self.val.type.template_argument (0) - value_type = self.val.type.template_argument (1) - pair_type \ - = lookup_stlport_type ('pair<%s const,%s>' % (key_type,value_type)) - node_type \ - = lookup_stlport_priv_type ('_Rb_tree_node<%s >' % str (pair_type)) - return self.Iterator (RbtreeIterator (self.val), node_type) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - count = get_non_debug_impl (self.val, '_M_t')['_M_node_count'] - return ('%s<%s> with %d elements' % (self.typename, ta0, count)) - - def display_hint (self): - return 'map' - - -class SetPrinter: - "Pretty printer for std::set and std::multiset." - - class Iterator: - def __init__ (self, rbiter, node_type): - self.rbiter = rbiter - self.node_type = node_type - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - item = self.rbiter.next().dereference() - element = (item.cast (self.node_type))['_M_value_field'] - count = self.count - self.count += 1 - return ('[%d]' % count, element) - - def __init__ (self, typename, val): - self.typename = typename - self.val = val - - def children (self): - value_type = self.val.type.template_argument (0) - node_type \ - = lookup_stlport_priv_type ('_Rb_tree_node<%s>' % (value_type)) - return self.Iterator (RbtreeIterator (self.val), node_type) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - count = get_non_debug_impl (self.val, '_M_t')['_M_node_count'] - return ('%s<%s> with %d elements' % (self.typename, ta0, count)) - - def display_hint (self): - return 'array' - - -class SlistPrinter: - "Pretty printer for std::slist." - - class Iterator: - def __init__ (self, node_type, head): - self.node_type = node_type - self.item = head['_M_next'] - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.item == 0: - raise StopIteration - node = self.item.cast (self.node_type).dereference() - self.item = node['_M_next'] - count = self.count - self.count += 1 - return ('[%d]' % count, node['_M_data']) - - def __init__(self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - - def children (self): - ta0 = self.val.type.template_argument(0) - node_type = lookup_stlport_priv_type ('_Slist_node<%s>' % ta0).pointer() - return self.Iterator (node_type, self.val['_M_head']['_M_data']) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - if self.val['_M_head']['_M_data']['_M_next'] == 0: - return 'empty %s<%s>' % (self.typename, ta0) - return '%s<%s>' % (self.typename, ta0) - - def display_hint (self): - return 'array' - - -class StringPrinter: - "Pretty printer for std::string or std::wstring." - - def __init__ (self, _typename, val): - self.val = get_non_debug_impl (val) - - def to_string (self): - try: - # STLport 5.2 and later - return self.val['_M_start_of_storage']['_M_data'] - except RuntimeError: - try: - # STLport 5.0 and 5.1 with short string optimization - static_buf = self.val['_M_buffers']['_M_static_buf'] - data = self.val['_M_end_of_storage']['_M_data'] - if static_buf.address + 1 == data: - ta0 = self.val.type.template_argument (0) - start = static_buf.cast (ta0.pointer()) - finish = self.val['_M_finish'] - if start == finish: - # STLport 5.0 without _STLP_FORCE_STRING_TERMINATION - return "" - return start - return self.val['_M_buffers']['_M_dynamic_buf'] - except RuntimeError: - # STLport 5.0 and 5.1 without short string optimization, - # and STLport 4.6 - start = self.val['_M_start'] - finish = self.val['_M_finish'] - if start == finish: - # STLport 5.0 without _STLP_FORCE_STRING_TERMINATION - return "" - return start - - def display_hint (self): - return 'string' - - -class VectorPrinter: - "Pretty printer for std::vector." - - class Iterator: - - def __init__ (self, start, finish, bit_vector): - self.bit_vector = bit_vector - self.count = 0 - if bit_vector: - self.item = start['_M_p'] - self.io = start['_M_offset'] - self.finish = finish['_M_p'] - self.fo = finish['_M_offset'] - self.isize = 8 * self.item.dereference().type.sizeof - else: - self.item = start - self.finish = finish - - def __iter__ (self): - return self - - def next (self): - count = self.count - self.count += 1 - if self.bit_vector: - if self.item == self.finish and self.io == self.fo: - raise StopIteration - element = self.item.dereference() - value = 0 - if element & (1 << self.io): - value = 1 - self.io += 1 - if self.io >= self.isize: - self.item += 1 - self.io = 0 - return ('[%d]' % count, value) - else: - if self.item == self.finish: - raise StopIteration - element = self.item.dereference() - self.item += 1 - return ('[%d]' % count, element) - - def __init__ (self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - self.bit_vector \ - = val.type.template_argument (0).code == gdb.TYPE_CODE_BOOL - - def children (self): - start = self.val['_M_start'] - finish = self.val['_M_finish'] - return self.Iterator (start, finish, self.bit_vector) - - def to_string (self): - if self.bit_vector: - start = self.val['_M_start']['_M_p'] - so = self.val['_M_start']['_M_offset'] - finish = self.val['_M_finish']['_M_p'] - fo = self.val['_M_finish']['_M_offset'] - end = self.val['_M_end_of_storage']['_M_data'] - isize = 8 * start.dereference().type.sizeof - length = (isize - so) + isize * (finish - start - 1) + fo - capacity = isize * (end - start) - return ('%s<bool> of length %d, capacity %d' - % (self.typename, length, capacity)) - else: - start = self.val['_M_start'] - finish = self.val['_M_finish'] - end = self.val['_M_end_of_storage']['_M_data'] - length = finish - start - capacity = end - start - ta0 = self.val.type.template_argument (0) - return ('%s<%s> of length %d, capacity %d' - % (self.typename, ta0, length, capacity)) - - def display_hint (self): - if print_vector_with_indices: - return None - else: - return 'array' - - -class WrapperPrinter: - "Pretty printer for std::stack, std::queue, and std::priority_queue." - - def __init__ (self, typename, val): - self.typename = typename - self.val = val - self.visualizer = gdb.default_visualizer (val['c']) - - def children (self): - return self.visualizer.children() - - def to_string (self): - ta0 = self.val.type.template_argument (0) - return ('%s<%s>, wrapping %s' - % (self.typename, ta0, self.visualizer.to_string())) - - def display_hint (self): - if hasattr (self.visualizer, 'display_hint'): - return self.visualizer.display_hint() - return None - - -class UnorderedMapPrinter: - """Pretty printer for std::tr1::unordered_map - and std::tr1::unordered_multimap.""" - - class Iterator: - def __init__ (self, node_type, head): - self.node_type = node_type - self.item = head['_M_next'] - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.item == 0 and self.count % 2 == 0: - raise StopIteration - if self.count % 2 == 0: - self.pair = self.item.cast (self.node_type).dereference() - self.item = self.pair['_M_next'] - element = self.pair['_M_data']['first'] - else: - element = self.pair['_M_data']['second'] - count = self.count - self.count += 1 - return ('[%d]' % count, element) - - def __init__(self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - - def children (self): - key_type = self.val.type.template_argument (0) - value_type = self.val.type.template_argument (1) - pair_type \ - = lookup_stlport_type ('pair<%s const,%s>' % (key_type,value_type)) - node_type \ - = lookup_stlport_priv_type ('_Slist_node<%s >' - % str (pair_type)).pointer() - elements = get_non_debug_impl (self.val, '_M_ht')['_M_elems'] - return self.Iterator (node_type, elements['_M_head']['_M_data']) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - length = get_non_debug_impl (self.val, '_M_ht')['_M_num_elements'] - if length == 0: - return 'empty %s<%s>' % (self.typename, ta0) - return '%s<%s> with %d elements' % (self.typename, ta0, length) - - def display_hint (self): - return 'map' - - -class UnorderedSetPrinter: - """Pretty printer for std::tr1::unordered_set - and std::tr1::unordered_multiset.""" - - class Iterator: - def __init__ (self, node_type, head): - self.node_type = node_type - self.item = head['_M_next'] - self.count = 0 - - def __iter__ (self): - return self - - def next (self): - if self.item == 0: - raise StopIteration - node = self.item.cast (self.node_type).dereference() - self.item = node['_M_next'] - count = self.count - self.count += 1 - return ('[%d]' % count, node['_M_data']) - - def __init__(self, typename, val): - self.typename = typename - self.val = get_non_debug_impl (val) - - def children (self): - ta0 = self.val.type.template_argument(0) - node_type = lookup_stlport_priv_type ('_Slist_node<%s>' % ta0).pointer() - elements = get_non_debug_impl (self.val, '_M_ht')['_M_elems'] - return self.Iterator (node_type, elements['_M_head']['_M_data']) - - def to_string (self): - ta0 = self.val.type.template_argument (0) - length = get_non_debug_impl (self.val, '_M_ht')['_M_num_elements'] - if length == 0: - return 'empty %s<%s>' % (self.typename, ta0) - return '%s<%s> with %d elements' % (self.typename, ta0, length) - - def display_hint (self): - return 'array' - - -class AutoptrPrinter: - "Pretty printer for std::auto_ptr." - - def __init__ (self, typename, val): - self.typename = typename - self.val = val - - def to_string (self): - ta0 = self.val.type.template_argument (0) - pointer = self.val['_M_p'].cast (ta0.pointer()) - if pointer == 0: - return ('%s<%s> (empty)' % (self.typename, ta0)) - else: - return ('%s<%s>, pointing to %s' - % (self.typename, ta0, pointer.dereference())) - - def display_hint (self): - return None - - -class SharedptrPrinter: - "Pretty printer for std::shared_ptr and std::weak_ptr." - - def __init__ (self, typename, val): - self.typename = typename - self.val = val - - def to_string (self): - ta0 = self.val.type.template_argument (0) - pointer = self.val['px'].cast (ta0.pointer()) - if pointer == 0: - return ('%s<%s> (empty)' % (self.typename, ta0)) - else: - count = self.val['pn']['pi_']['use_count_'] - return ('%s<%s> (count %d), pointing to %s' - % (self.typename, ta0, count, pointer.dereference())) - - def display_hint (self): - return None - - -def lookup_function (val): - "Look-up and return a pretty-printer that can print val." - - type = val.type - if type.code == gdb.TYPE_CODE_REF: - type = type.target() - type = type.unqualified().strip_typedefs() - - typename = type.tag - if typename == None: - return None - - for function in pretty_printers_dict: - if function.search (typename): - return pretty_printers_dict[function] (val) - return None - - -def register_stlport_printers (obj): - "Register STLport pretty-printers with object file obj." - - if obj == None: - obj = gdb - obj.pretty_printers.append (lookup_function) - - - -pretty_printers_dict = {} - -def add_entry (regex, printer, typename): - prefix = "^(stlpd?_std|_STL|std)::" - suffix = "<.*>$" - if typename != None: - typename = "std::" + typename - if regex[0:5] == "boost": - prefix = "" - pretty_printers_dict[re.compile (prefix+regex+suffix)] \ - = lambda val: printer (typename, val) - -add_entry ("basic_string", StringPrinter, None) -add_entry ("bitset", BitsetPrinter, "bitset") -add_entry ("deque", DequePrinter, "deque") -add_entry ("map", MapPrinter, "map") -add_entry ("list", ListPrinter, "list") -add_entry ("multimap", MapPrinter, "multimap") -add_entry ("multiset", SetPrinter, "multiset") -add_entry ("queue", WrapperPrinter, "queue") -add_entry ("priority_queue", WrapperPrinter, "priority_queue") -add_entry ("set", SetPrinter, "set") -add_entry ("slist", SlistPrinter, "slist") -add_entry ("stack", WrapperPrinter, "stack") -add_entry ("vector", VectorPrinter, "vector") - -add_entry ("tr1::unordered_map", UnorderedMapPrinter, "tr1::unordered_map") -add_entry ("tr1::unordered_multimap", UnorderedMapPrinter, "tr1::unordered_multimap") -add_entry ("tr1::unordered_set", UnorderedSetPrinter, "tr1::unordered_set") -add_entry ("tr1::unordered_multiset", UnorderedSetPrinter, "tr1::unordered_multiset") - -add_entry ("auto_ptr", AutoptrPrinter, "auto_ptr") -add_entry ("boost::shared_ptr", SharedptrPrinter, "tr1::shared_ptr") -add_entry ("boost::weak_ptr", SharedptrPrinter, "tr1::weak_ptr") diff --git a/share/pretty-printers/stlport/test/.gdbinit b/share/pretty-printers/stlport/test/.gdbinit deleted file mode 100644 index ec42f67..0000000 --- a/share/pretty-printers/stlport/test/.gdbinit +++ /dev/null @@ -1,12 +0,0 @@ -python -import os -import sys - -sys.path.insert (0, os.getcwd() + '/..') -import stlport.printers -stlport.printers.register_stlport_printers (None) - -# stlport.printers.stlport_version = 5.2 -# stlport.printers.print_vector_with_indices = False - -end diff --git a/share/pretty-printers/stlport/test/Makefile b/share/pretty-printers/stlport/test/Makefile deleted file mode 100644 index 3268fb7..0000000 --- a/share/pretty-printers/stlport/test/Makefile +++ /dev/null @@ -1,117 +0,0 @@ -CXX=g++ -GDB=gdb - -# Adjust and uncomment to enable the corresponding tests -# STLPORT46_ROOT_DIR=/usr/local/stlport-4.6.2 -# STLPORT50_ROOT_DIR=/usr/local/stlport-5.0.3 -# STLPORT51_ROOT_DIR=/usr/local/stlport-5.1.7 -# STLPORT52_ROOT_DIR=/usr/local/stlport-5.2.1 - -# To enable Boost support you might need to patch -# $(STLPORT52_ROOT_DIR)/include/stlport/stl/type_traits.h -# to include <boost/type_traits/remove_const.hpp>. -# STLPORT52_USE_BOOST_SUPPORT=1 - - - -# Common flags for STLport 4.6.x tests -STLPORT46_FLAGS = \ - $(CXXFLAGS) $(LDFLAGS) \ - -I$(STLPORT46_ROOT_DIR)/include/stlport \ - -L$(STLPORT46_ROOT_DIR)/lib \ - -Wl,-R$(STLPORT46_ROOT_DIR)/lib \ - -pthread - -# Common flags for STLport 5.0.x tests -STLPORT50_FLAGS = \ - $(CXXFLAGS) $(LDFLAGS) \ - -I$(STLPORT50_ROOT_DIR)/include/stlport \ - -L$(STLPORT50_ROOT_DIR)/lib \ - -Wl,-R$(STLPORT50_ROOT_DIR)/lib \ - -pthread - -# Common flags for STLport 5.1.x tests -STLPORT51_FLAGS = \ - $(CXXFLAGS) $(LDFLAGS) \ - -I$(STLPORT51_ROOT_DIR)/include/stlport \ - -L$(STLPORT51_ROOT_DIR)/lib \ - -Wl,-R$(STLPORT51_ROOT_DIR)/lib \ - -pthread - -# Common flags for STLport 5.2.x tests -STLPORT52_FLAGS = \ - $(CXXFLAGS) $(LDFLAGS) \ - -I$(STLPORT52_ROOT_DIR)/include/stlport \ - -L$(STLPORT52_ROOT_DIR)/lib \ - -Wl,-R$(STLPORT52_ROOT_DIR)/lib \ - -pthread - -ifneq ($(STLPORT52_USE_BOOST_SUPPORT),) -STLPORT52_FLAGS += -D_STLP_USE_BOOST_SUPPORT -endif - - - -# Add STLport 4.6.x tests to $(TARGETS) (if enabled) -ifneq ($(STLPORT46_ROOT_DIR),) -TARGETS += test_stlport46 test_stlport46d -endif - -# Add STLport 5.0.x tests to $(TARGETS) (if enabled) -ifneq ($(STLPORT50_ROOT_DIR),) -TARGETS += test_stlport50 test_stlport50d -endif - -# Add STLport 5.1.x tests to $(TARGETS) (if enabled) -ifneq ($(STLPORT51_ROOT_DIR),) -TARGETS += test_stlport51 test_stlport51d -endif - -# Add STLport 5.2.x tests to $(TARGETS) (if enabled) -ifneq ($(STLPORT52_ROOT_DIR),) -TARGETS += test_stlport52 test_stlport52d -endif - - - -default: run -ifeq ($(TARGETS),) - @echo "You need to configure the STLport directory at the start of the Makefile." -endif - -run: build -ifneq ($(TARGETS),) - for TARGET in $(TARGETS); do \ - echo "Running test for $$TARGET"; \ - $(GDB) -batch -x script ./$$TARGET; \ - done -endif - -build: $(TARGETS) - -test_stlport46: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT46_FLAGS) -lstlport_gcc - -test_stlport46d: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT46_FLAGS) -lstlport_gcc_stldebug -D_STLP_DEBUG - -test_stlport50: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT50_FLAGS) -lstlport - -test_stlport50d: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT50_FLAGS) -lstlportstlg -D_STLP_DEBUG - -test_stlport51: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT51_FLAGS) -lstlport - -test_stlport51d: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT51_FLAGS) -lstlportstlg -D_STLP_DEBUG - -test_stlport52: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT52_FLAGS) -lstlport - -test_stlport52d: test.cpp Makefile - $(CXX) -o $@ $< -g $(STLPORT52_FLAGS) -lstlportstlg -D_STLP_DEBUG - -clean: - rm -f test_stlport* diff --git a/share/pretty-printers/stlport/test/script b/share/pretty-printers/stlport/test/script deleted file mode 100644 index 109ff3e..0000000 --- a/share/pretty-printers/stlport/test/script +++ /dev/null @@ -1,41 +0,0 @@ -b foo -r -fin -p string1 -p string2 -p string3 -p wstring1 -p wstring2 -p wstring3 -p vector1 -p vector2 -p map1 -p multimap1 -p set1 -p multiset1 -p list1 -p list2 -p slist1 -p slist2 -p deque1 -p deque2 -p stack1 -p queue1 -p priority_queue1 -p bitset1 -p bitset2 -p unordered_map1 -p unordered_map2 -p unordered_multimap1 -p unordered_multimap2 -p unordered_set1 -p unordered_set2 -p unordered_multiset1 -p unordered_multiset2 -p auto_ptr1 -p auto_ptr2 -p shared_ptr1 -p shared_ptr2 -p weak_ptr1 -p weak_ptr2 -q diff --git a/share/pretty-printers/stlport/test/test.cpp b/share/pretty-printers/stlport/test/test.cpp deleted file mode 100644 index 950ef1f..0000000 --- a/share/pretty-printers/stlport/test/test.cpp +++ /dev/null @@ -1,181 +0,0 @@ -#include <bitset> -#include <deque> -#include <list> -#include <memory> -#include <map> -#include <queue> -#include <set> -#ifdef _STLPORT_VERSION -#include <slist> -#endif // _STLPORT_VERSION -#include <string> -#include <stack> -#if _STLPORT_VERSION >= 0x520 -#include <unordered_map> -#include <unordered_set> -#endif //_STLPORT_VERSION >= 0x520 -#include <vector> - -#ifdef _STLPORT_VERSION -#define STD_TR1 std::tr1 -#else // _STLPORT_VERSION -#define STD_TR1 std -#endif // _STLPORT_VERSION - -struct Large { - char m_foo[100]; -}; - -void foo() { } - -int main() { - - std::string string1 = ""; - std::string string2 = "a short string"; - std::string string3 = "a very long string ..."; - - std::wstring wstring1 = L""; - std::wstring wstring2 = L"a short string"; - std::wstring wstring3 = L"a very long string ..."; - - std::vector<int> vector1; - vector1.push_back( 100); - vector1.push_back( 200); - vector1.push_back( 300); - - std::vector<bool> vector2; - vector2.push_back( true); - vector2.push_back( false); - vector2.push_back( true); - - std::map<int,int> map1; - map1[1] = -1; - map1[21] = -21; - map1[42] = -42; - - std::multimap<int,int> multimap1; - multimap1.insert (std::pair<int,int> (1, -1)); - multimap1.insert (std::pair<int,int> (1, -2)); - multimap1.insert (std::pair<int,int> (21, -21)); - multimap1.insert (std::pair<int,int> (21, -22)); - multimap1.insert (std::pair<int,int> (42, -42)); - multimap1.insert (std::pair<int,int> (42, -43)); - - std::set<int> set1; - set1.insert( 100); - set1.insert( 200); - set1.insert( 300); - - std::multiset<int> multiset1; - multiset1.insert( 100); - multiset1.insert( 100); - multiset1.insert( 200); - multiset1.insert( 200); - multiset1.insert( 300); - multiset1.insert( 300); - - std::list<int> list1; - std::list<int> list2; - list1.push_back( 100); - list1.push_back( 200); - list1.push_back( 300); - -#ifdef _STLPORT_VERSION - std::slist<int> slist1; - std::slist<int> slist2; - slist1.push_front( 100); - slist1.push_front( 200); - slist1.push_front( 300); -#else // _STLPORT_VERSION - std::string slist1 = "std::slist not supported"; - std::string slist2 = "std::slist not supported"; -#endif // _STLPORT_VERSION - - std::deque<int> deque1; - deque1.push_front( 100); - deque1.push_front( 200); - deque1.push_front( 300); - - std::deque<Large> deque2; - deque2.push_back( Large()); - deque2.push_back( Large()); - deque2.push_front( Large()); - - std::stack<int> stack1; - stack1.push( 100); - stack1.push( 200); - stack1.push( 300); - - std::queue<int> queue1; - queue1.push( 100); - queue1.push( 200); - queue1.push( 300); - - std::priority_queue<int> priority_queue1; - priority_queue1.push( 200); - priority_queue1.push( 100); - priority_queue1.push( 300); - - std::bitset<100> bitset1; - bitset1[2] = 1; - bitset1[42] = 1; - bitset1[64] = 1; - - std::bitset<1> bitset2; - bitset2[0] = 1; - -#if _STLPORT_VERSION >= 0x520 - STD_TR1::unordered_map<int,int> unordered_map1; - STD_TR1::unordered_map<int,int> unordered_map2; - for( int i = 0; i < 5; ++i) - unordered_map1[i*i] = -i*i; - - STD_TR1::unordered_multimap<int,int> unordered_multimap1; - STD_TR1::unordered_multimap<int,int> unordered_multimap2; - for( int i = 0; i < 5; ++i) { - unordered_multimap1.insert( std::pair<int,int>( i*i, -i*i)); - unordered_multimap1.insert( std::pair<int,int>( i*i, i*i)); - } - - STD_TR1::unordered_set<int> unordered_set1; - STD_TR1::unordered_set<int> unordered_set2; - for( int i = 0; i < 5; ++i) - unordered_set1.insert( i*i); - - STD_TR1::unordered_multiset<int> unordered_multiset1; - STD_TR1::unordered_multiset<int> unordered_multiset2; - for( int i = 0; i < 5; ++i) { - unordered_multiset1.insert( -i*i); - unordered_multiset1.insert( i*i); - } -#else // _STLPORT_VERSION < 0x520 - std::string unordered_map1 = "std::tr1::unordered_map not supported"; - std::string unordered_map2 = "std::tr1::unordered_map not supported"; - std::string unordered_multimap1 = "std::tr1::unordered_multimap not supported"; - std::string unordered_multimap2 = "std::tr1::unordered_multimap not supported"; - std::string unordered_set1 = "std::tr1::unordered_set not supported"; - std::string unordered_set2 = "std::tr1::unordered_set not supported"; - std::string unordered_multiset1 = "std::tr1::unordered_multiset not supported"; - std::string unordered_multiset2 = "std::tr1::unordered_multiset not supported"; -#endif // _STLPORT_VERSION < 0x520 - - std::auto_ptr<Large> auto_ptr1( new Large()); - std::auto_ptr<Large> auto_ptr2; - -#ifdef _STLP_USE_BOOST_SUPPORT - STD_TR1::shared_ptr<Large> shared_ptr1( new Large); - STD_TR1::shared_ptr<Large> shared_ptr2; - - STD_TR1::weak_ptr<Large> weak_ptr1( shared_ptr1); - STD_TR1::weak_ptr<Large> weak_ptr2; -#else // _STLP_USE_BOOST_SUPPORT - std::string shared_ptr1 = "std::tr1::shared_ptr not supported"; - std::string shared_ptr2 = "std::tr1::shared_ptr not supported"; - - std::string weak_ptr1 = "std::tr1::weak_ptr not supported"; - std::string weak_ptr2 = "std::tr1::weak_ptr not supported"; -#endif // _STLP_USE_BOOST_SUPPORT - - foo(); - return 0; -} |