Yahoo! has embraced, adopted, and contributed to community-driven initiatives and related open source technologies. This, in turn, enables engineers and researchers around the world to cost effectively tackle the most challenging problems in computing today, including search, analytics, machine learning, scientific modeling and more. Yahoo! has made a deep commitment to open source software by joining the Linux Foundation in 2011, and has contributed in several ways by participating in the working groups and initiatives focused on virtualization, cloud computing and legal topics, such as open compliance. Yahoo! has a long history of contributing code to the open source community. In 2009, Yahoo donated Traffic Server, a scalable caching proxy to the Apache Software Foundation, after becoming a Platinum sponsor in 2007. Today, several members of Yahoo!'s development teams are active, long-term code contributors to Apache Hadoop, the open source platform that makes it possible to efficiently process vast amounts of data on a cluster of commodity hardware. Yahoo! has developers and APIs deeply focused on PHP, Java, JavaScript, AJAX, ColdFusion, Ruby, Python and much more, in addition to many cross-platform applications. Yahoo! has also been open about sharing user interface tools, as you can see at the Yahoo! User Interface Library (http://developer.yahoo.com/yui/). And, Yahoo!'s site was built from day one to run on FreeBSD technology. Yahoo! will continue to contribute to the open source community and is leading the industry in supporting free and open software for building the next-generation of Internet-scale web services, contributing to an open source version of these powerful tools which are freely available to anyone who needs them. Below, the Yahoo! Connected TV team would like to give the appropriate attributions to all the great open source components leveraged in this release: ----------------------------------------------------------------------------------------------------------- OpenSSL http://www.openssl.org/ /* ==================================================================== * Copyright (c) 1998-2008 The OpenSSL Project. All rights reserved. * * This product includes cryptographic software written by Eric Young * (eay@cryptsoft.com). This product includes software written by Tim * Hudson (tjh@cryptsoft.com). /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) * All rights reserved. * \"This product includes cryptographic software written by * Eric Young (eay@cryptsoft.com)\" ----------------------------------------------------------------------------------------------------------- libcurl http://curl.haxx.se/libcurl/ COPYRIGHT AND PERMISSION NOTICE Copyright (c) 1996 - 2010, Daniel Stenberg, . All rights reserved. ----------------------------------------------------------------------------------------------------------- LibPNG mozpngconf.h libpng versions 1.2.6, August 15, 2004, through 1.4.3, June 26, 2010, are Copyright (c) 2004, 2006-2007 Glenn Randers-Pehrson, and are distributed according to the same disclaimer and license as libpng-1.2.5 with the following individual added to the list of Contributing Authors Cosmin Truta libpng versions 1.0.7, July 1, 2000, through 1.2.5 - October 3, 2002, are Copyright (c) 2000-2002 Glenn Randers-Pehrson, and are distributed according to the same disclaimer and license as libpng-1.0.6 with the following individuals added to the list of Contributing Authors Simon-Pierre Cadieux Eric S. Raymond Gilles Vollant Tom Lane Glenn Randers-Pehrson Willem van Schaik John Bowler Kevin Bracey Sam Bushell Magnus Holmgren Greg Roelofs Tom Tanner Andreas Dilger Dave Martindale Guy Eric Schalnat Paul Schmidt Tim Wegner ----------------------------------------------------------------------------------------------------------- ICU http://www.icu-project.org License to use/distribute only requires publication of copyright notice and permission. http://source.icu-project.org/repos/icu/icu/trunk/license.html COPYRIGHT AND PERMISSION NOTICE Copyright (c) 1995-2006 International Business Machines Corporation and others All rights reserved. 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, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, provided that the above copyright notice(s) and this permission notice appear in all copies of the Software and that both the above copyright notice(s) and this permission notice appear in supporting documentation. 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization of the copyright holder. All trademarks and registered trademarks mentioned herein are the property of their respective owners. ----------------------------------------------------------------------------------------------------------- Zlib (C) 1995-2004 Jean-loup Gailly and Mark Adler This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Jean-loup Gailly Mark Adler jloup@gzip.org madler@alumni.caltech.edu ----------------------------------------------------------------------------------------------------------- Cairo Every source file in the implementation\[*\] of cairo is available to be redistributed and/or modified under the terms of either the GNU Lesser General Public License (LGPL) version 2.1 or the Mozilla Public License (MPL) version 1.1. Some files are available under more liberal terms, but we believe that in all cases, each file may be used under either the LGPL or the MPL. http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html http://www.mozilla.org/MPL/MPL-1.1.html copies of these licenses are included at the end of this notice. ----------------------------------------------------------------------------------------------------------- Pixman Copyright 1987, 1988, 1989, 1998 The Open Group Copyright 1987, 1988, 1989 Digital Equipment Corporation Copyright 1999, 2004, 2008 Keith Packard Copyright 2000 SuSE, Inc. Copyright 2000 Keith Packard, member of The XFree86 Project, Inc. Copyright 2004, 2005, 2007, 2008 Red Hat, Inc. Copyright 2004 Nicholas Miell Copyright 2005 Lars Knoll & Zack Rusin, Trolltech Copyright 2005 Trolltech AS Copyright 2007 Luca Barbato Copyright 2008 Aaron Plattner, NVIDIA Corporation Copyright 2008 Rodrigo Kumpera Copyright 2008 André Tupinambá Copyright 2008 Mozilla Corporation Copyright 2008 Frederic Plourde ----------------------------------------------------------------------------------------------------------- Mozilla SpiderMonkey http://www.mozilla.org/js/spidermonkey/ Most files in the sources are Tri-licensed in LGPL v. 2.1 or MPL v. 1.1 or GPL 2.0 http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html http://www.mozilla.org/MPL/MPL-1.1.html http://www.gnu.org/licenses/old-licenses/gpl-2.0.html All three licenses are also included at the end of this notice. Files that specify other licenses can be found here: ########################### ./src/md5.js /* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for more info. */ ########################### ./src/dtoa.c /**************************************************************** * * The author of this software is David M. Gay. * * Copyright (c) 1991, 2000, 2001 by Lucent Technologies. * * Permission to use, copy, modify, and distribute this software for any * purpose without fee is hereby granted, provided that this entire notice * is included in all copies of any software which is or includes a copy * or modification of this software and in all copies of the supporting * documentation for such software. * * THIS SOFTWARE IS BEING PROVIDED \"AS IS\", WITHOUT ANY EXPRESS OR IMPLIED * WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. * ***************************************************************/ ########################### ./src/v8/run-richards.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/richards.js // Copyright 2007 Google Inc. All rights reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // This is a JavaScript implementation of the Richards // benchmark from: // // http://www.cl.cam.ac.uk/~mr10/Bench.html // // The benchmark was originally implemented in BCPL by ########################### ./src/v8/base.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/run-deltablue.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/crypto.js /* * Copyright (c) 2003-2005 Tom Wu * All Rights Reserved. * * 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\" AND WITHOUT WARRANTY OF ANY KIND, * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. * * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL, * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. * * In addition, the following condition applies: * * All redistributions must retain an intact copy of this copyright notice * and disclaimer. */ ########################### ./src/v8/run-crypto.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/run-earley-boyer.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/deltablue.js // Copyright 2008 Google Inc. All Rights Reserved. // Copyright 1996 John Maloney and Mario Wolczko. // 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 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, write to the Free Software // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA // This implementation of the DeltaBlue benchmark is derived // from the Smalltalk implementation by John Maloney and Mario // Wolczko. Some parts have been translated directly, whereas // others have been modified more aggresively to make it feel // more like a JavaScript program. ########################### ./src/v8/run-raytrace.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ########################### ./src/v8/run.js // Copyright 2008 Google Inc. All Rights Reserved. // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following // disclaimer in the documentation and/or other materials provided // with the distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ----------------------------------------------------------------------------------------------------------- SQLite http://www.sqlite.org/ All of the deliverable code in SQLite has been dedicated to the public domain by the authors. All code authors, and representatives of the companies they work for, have signed affidavits dedicating their contributions to the public domain and originals of those signed affidavits are stored in a firesafe at the main offices of Hwaci. Anyone is free to copy, modify, publish, use, compile, sell, or distribute the original SQLite code, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. ----------------------------------------------------------------------------------------------------------- Scramble.c Artistic http://www.opensource.org/licenses/artistic-license-1.0.php 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major archive site such as ftp.uu.net, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) accompany any non-standard executables with their corresponding Standard Version executables, giving the non-standard executables non-standard names, and clearly documenting the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. 5. You may charge a reasonable copying fee for any distribution of this Package. You may charge any fee you choose for support of this Package. You may not charge a fee for this Package itself. However, you may distribute this Package in aggregate with other (possibly commercial) programs as part of a larger (possibly commercial) software distribution provided that you do not advertise this Package as a product of your own. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whomever generated them, and may be sold commercially, and may be aggregated with this Package. 7. C or perl subroutines supplied by you and linked into this Package shall not be considered part of this Package. 8. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 9. THIS PACKAGE IS PROVIDED \"AS IS\" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ----------------------------------------------------------------------------------------------------------- Md5.c http://www.w3.org/TR/1998/REC-DSig-label/MD5-1_0 /* * This code implements the MD5 message-digest algorithm. * The algorithm is due to Ron Rivest. This code was * written by Colin Plumb in 1993, no copyright is claimed. * This code is in the public domain; do with it what you wish. ----------------------------------------------------------------------------------------------------------- Zip.cpp/unzip.cpp http://www.info-zip.org/ This is version 2009-Jan-02 of the Info-ZIP license. The definitive version of this document should be available at ftp://ftp.info-zip.org/pub/infozip/license.html indefinitely and a copy at http://www.info-zip.org/pub/infozip/license.html. Copyright (c) 1990-2009 Info-ZIP. All rights reserved. For the purposes of this copyright and license, \"Info-ZIP\" is defined as the following set of individuals: Mark Adler, John Bush, Karl Davis, Harald Denker, Jean-Michel Dubois, Jean-loup Gailly, Hunter Goatley, Ed Gordon, Ian Gorman, Chris Herborth, Dirk Haase, Greg Hartwig, Robert Heath, Jonathan Hudson, Paul Kienitz, David Kirschbaum, Johnny Lee, Onno van der Linden, Igor Mandrichenko, Steve P. Miller, Sergio Monesi, Keith Owens, George Petrov, Greg Roelofs, Kai Uwe Rommel, Steve Salisbury, Dave Smith, Steven M. Schweda, Christian Spieler, Cosmin Truta, Antoine Verheijen, Paul von Behren, Rich Wales, Mike White. This software is provided \"as is,\" without warranty of any kind, express or implied. In no event shall Info-ZIP or its contributors be held liable for any direct, indirect, incidental, special or consequential damages arising out of the use of or inability to use this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the above disclaimer and the following restrictions: 1. Redistributions of source code (in whole or in part) must retain the above copyright notice, definition, disclaimer, and this list of conditions. 2. Redistributions in binary form (compiled executables and libraries) must reproduce the above copyright notice, definition, disclaimer, and this list of conditions in documentation and/or other materials provided with the distribution. Additional documentation is not needed for executables where a command line license option provides these and a note regarding this option is in the executable's startup banner. The sole exception to this condition is redistribution of a standard UnZipSFX binary (including SFXWiz) as part of a self-extracting archive; that is permitted without inclusion of this license, as long as the normal SFX banner has not been removed from the binary or disabled. 3. Altered versions--including, but not limited to, ports to new operating systems, existing ports with new graphical interfaces, versions with modified or added functionality, and dynamic, shared, or static library versions not from Info-ZIP--must be plainly marked as such and must not be misrepresented as being the original source or, if binaries, compiled from the original source. Such altered versions also must not be misrepresented as being Info-ZIP releases--including, but not limited to, labeling of the altered versions with the names \"Info-ZIP\" (or any variation thereof, including, but not limited to, different capitalizations), \"Pocket UnZip,\" \"WiZ\" or \"MacZip\" without the explicit permission of Info-ZIP. Such altered versions are further prohibited from misrepresentative use of the Zip-Bugs or Info-ZIP e-mail addresses or the Info-ZIP URL(s), such as to imply Info-ZIP will provide support for the altered versions. 4. Info-ZIP retains the right to use the names \"Info-ZIP,\" \"Zip,\" \"UnZip,\" \"UnZipSFX,\" \"WiZ,\" \"Pocket UnZip,\" \"Pocket Zip,\" and \"MacZip\" for its own source and binary releases. ----------------------------------------------------------------------------------------------------------- Files with Copyright, Aladdin Enterprises /* * yguid.c * yguid * * Created by Sam Magnuson Aug 21 2007 * Copyright 2007 Yahoo!, Inc. All rights reserved. * / / ------------------- BEGIN INLINING OF MD5 CODE ------------------------ / / ------------------- BEGIN INLINING OF MD5 CODE ------------------------ / / Copyright (C) 1999, 2002 Aladdin Enterprises. All rights reserved. This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. L. Peter Deutsch ghost@aladdin.com Independent implementation of MD5 (RFC 1321). This code implements the MD5 Algorithm defined in RFC 1321, whose text is available at http://www.ietf.org/rfc/rfc1321.txt The code is derived from the text of the RFC, including the test suite (section A.5) but excluding the rest of Appendix A. It does not include any code or documentation that is identified in the RFC as being copyrighted. The original and principal author of md5.h is L. Peter Deutsch . Other authors are noted in the change history that follows (in reverse chronological order): 2002-04-13 lpd Removed support for non-ANSI compilers; removed references to Ghostscript; clarified derivation from RFC 1321; now handles byte order either statically or dynamically. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5); added conditionalization for C++ compilation from Martin Purschke . 1999-05-03 lpd Original version. */ ----------------------------------------------------------------------------------------------------------- Forensic Match Files with Forensic Similarities to Color conversion between RGB and HSL, by Paul Bourke http://ozviz.wasp.uwa.edu.au/~pbourke/texture_colour/convert/ The contents of this web site are %A%© Copyright Paul Bourke or a third party contributer where indicated. You may print or save an electronic copy of parts of this web site for your own personal use. Permission must be sought for any other use. ----------------------------------------------------------------------------------------------------------- CipherSaber http://ciphersaber.gurus.org/ CipherSaber, CS1, CS2, and CipherKnight are trademarks of Arnold G. Reinhold. A free, nonexclusive license is hereby granted to use the marks CipherSaber, CS1 and CS2 on any product that is interoperable with CipherSaber as demonstrated by the ability to decrypt the test samples supplied and to produce files readable by other implementations of CipherSaber. The marks may also be used in supporting material that promotes CipherSaber. ----------------------------------------------------------------------------------------------------------- Robust Glob http://www.cse.yorku.ca/~oz/glob.bun X * robust glob pattern matcher X * ozan s. yigit/dec 1994 X * public domain ----------------------------------------------------------------------------------------------------------- W3C exception codes http://www.w3.org Copyright %A%© 2009 World Wide Web Consortium, (Massachusetts Institute of Technology, European Research Consortium for Informatics and Mathematics, Keio University). All Rights Reserved. This work is distributed under the W3C%A%® Software License [1] 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. [1] http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231 License By obtaining, using and/or copying this work, you (the licensee) agree that you have read, understood, and will comply with the following terms and conditions. Permission to copy, modify, and distribute this software and its documentation, with or without modification, for any purpose and without fee or royalty is hereby granted, provided that you include the following on ALL copies of the software and documentation or portions thereof, including modifications: The full text of this NOTICE in a location viewable to users of the redistributed or derivative work. Any pre-existing intellectual property disclaimers, notices, or terms and conditions. If none exist, the W3C Software Short Notice should be included (hypertext is preferred, text is permitted) within the body of any redistributed or derivative code. Notice of any changes or modifications to the files, including the date changes were made. (We recommend you provide URIs to the location from which the code is derived.) Disclaimers THIS SOFTWARE AND DOCUMENTATION IS PROVIDED \"AS IS,\" AND COPYRIGHT HOLDERS MAKE NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO, WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE OR DOCUMENTATION WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS. COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR DOCUMENTATION. The name and trademarks of copyright holders may NOT be used in advertising or publicity pertaining to the software without specific, written prior permission. Title to copyright in this software and any associated documentation will at all times remain with copyright holders. Notes This version: http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231 ----------------------------------------------------------------------------------------------------------- libmng http://www.libmng.com/ /* ************************************************************************** */ /* * * */ /* * COPYRIGHT NOTICE: * */ /* * * */ /* * Copyright (c) 2000-2007 Gerard Juyn (gerard@libmng.com) * */ /* * [You may insert additional notices after this sentence if you modify * */ /* * this source] * */ /* * * */ /* * For the purposes of this copyright and license, \"Contributing Authors\" * */ /* * is defined as the following set of individuals: * */ /* * * */ /* * Gerard Juyn * */ /* * Glenn Randers-Pehrson * */ /* * * */ /* * The MNG Library is supplied \"AS IS\". The Contributing Authors * */ /* * disclaim all warranties, expressed or implied, including, without * */ /* * limitation, the warranties of merchantability and of fitness for any * */ /* * purpose. The Contributing Authors assume no liability for direct, * */ /* * indirect, incidental, special, exemplary, or consequential damages, * */ /* * which may result from the use of the MNG Library, even if advised of * */ /* * the possibility of such damage. * */ /* * * */ /* * Permission is hereby granted to use, copy, modify, and distribute this * */ /* * source code, or portions hereof, for any purpose, without fee, subject * */ /* * to the following restrictions: * */ /* * * */ /* * 1. The origin of this source code must not be misrepresented; * */ /* * you must not claim that you wrote the original software. * */ /* * * */ /* * 2. Altered versions must be plainly marked as such and must not be * */ /* * misrepresented as being the original source. * */ /* * * */ /* * 3. This Copyright notice may not be removed or altered from any source * */ /* * or altered source distribution. * */ /* * * */ /* * The Contributing Authors specifically permit, without fee, and * */ /* * encourage the use of this source code as a component to supporting * */ /* * the MNG and JNG file format in commercial products. If you use this * */ /* * source code in a product, acknowledgment would be highly appreciated. * */ /* * * */ /* ************************************************************************** */ /* * * */ /* * Parts of this software have been adapted from the libpng package. * */ /* * Although this library supports all features from the PNG specification * */ /* * (as MNG descends from it) it does not require the libpng package. * */ /* * It does require the zlib library and optionally the IJG jpeg library, * */ /* * and/or the \"little-cms\" library by Marti Maria (depending on the * */ /* * inclusion of support for JNG and Full-Color-Management respectively. * */ /* * * */ /* * This library's function is primarily to read and display MNG * */ /* * animations. It is not meant as a full-featured image-editing * */ /* * component! It does however offer creation and editing functionality * */ /* * at the chunk level. * */ /* * (future modifications may include some more support for creation * */ /* * and or editing) * */ /* * * */ /* ************************************************************************** */ ----------------------------------------------------------------------------------------------------------- C-Ares http://c-ares.haxx.se/ Copyright 1998 by the Massachusetts Institute of Technology. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of M.I.T. not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. M.I.T. makes no representations about the suitability of this software for any purpose. It is provided \"as is\" without express or implied warranty. ----------------------------------------------------------------------------------------------------------- libjpeg http://www.ijg.org The authors make NO WARRANTY or representation, either express or implied, with respect to this software, its quality, accuracy, merchantability, or fitness for a particular purpose. This software is provided \"AS IS\", and you, its user, assume the entire risk as to its quality and accuracy. This software is copyright (C) 1991-1998, Thomas G. Lane. All Rights Reserved except as specified below. Permission is hereby granted to use, copy, modify, and distribute this software (or portions thereof) for any purpose, without fee, subject to these conditions: (1) If any part of the source code for this software is distributed, then this README file must be included, with this copyright and no-warranty notice unaltered; and any additions, deletions, or changes to the original files must be clearly indicated in accompanying documentation. (2) If only executable code is distributed, then the accompanying documentation must state that \"this software is based in part on the work of the Independent JPEG Group\". (3) Permission for use of this software is granted only if the user accepts full responsibility for any undesirable consequences; the authors accept NO LIABILITY for damages of any kind. These conditions apply to any software derived from or based on the IJG code, not just to the unmodified library. If you use our work, you ought to acknowledge us. Permission is NOT granted for the use of any IJG author's name or company name in advertising or publicity relating to this software or products derived from it. This software may be referred to only as \"the Independent JPEG Group's software\". We specifically permit and encourage the use of this software as the basis of commercial products, provided that all warranty or liability claims are assumed by the product vendor. ansi2knr.c is included in this distribution by permission of L. Peter Deutsch, sole proprietor of its copyright holder, Aladdin Enterprises of Menlo Park, CA. ansi2knr.c is NOT covered by the above copyright and conditions, but instead by the usual distribution terms of the Free Software Foundation; principally, that you must include source code if you redistribute it. (See the file ansi2knr.c for full details.) However, since ansi2knr.c is not needed as part of any program generated from the IJG code, this does not limit you more than the foregoing paragraphs do. ----------------------------------------------------------------------------------------------------------- glib http://www.gtk.org/ Glib is licensed under the GNU LIBRARY GENERAL PUBLIC LICENSE Version 2, June 1991 a full copy of the LGPL v2 can be found at the end of this notice. ----------------------------------------------------------------------------------------------------------- freetype 2.3.9 http://freetype.sourceforge.net/ Portions of this software are copyright %A%© 2011 The FreeType Project (www.freetype.org). All rights reserved. ----------------------------------------------------------------------------------------------------------- fontconfig 2.8.0 Copyright %A%-%A%© 2001,2003 Keith Packard 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, and that the name of Keith Packard not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Keith Packard makes no representations about the suitability of this software for any purpose. It is provided \"as is\" without express or implied warranty. THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ----------------------------------------------------------------------------------------------------------- pango Pango is licensed under the GNU LIBRARY GENERAL PUBLIC LICENSE Version 2, June 1991 a full copy of the LGPL v2 can be found at the end of this notice. ----------------------------------------------------------------------------------------------------------- libxml http://xmlsoft.org/ Copyright (C) 1998-2003 Daniel Veillard. All Rights Reserved. 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 DANIEL VEILLARD BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of Daniel Veillard shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from him. Hash.c: /* * hash.c: chained hash tables * * Reference: Your favorite introductory book on algorithms * * Copyright (C) 2000 Bjorn Reese and Daniel Veillard. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * * Author: breese@users.sourceforge.net */ list.c: /* * list.c: lists handling implementation * * Copyright (C) 2000 Gary Pennington and Daniel Veillard. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * * Author: Gary.Pennington@uk.sun.com */ trio.c. trio.h, triode.h: * Copyright (C) 1998 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. ----------------------------------------------------------------------------------------------------------- mDNSResponder http://developer.apple.com/bonjour The majority of the source code in the mDNSResponder project is licensed under the terms of the Apache License, Version 2.0, available from: To accommodate license compatibility with the widest possible range of client code licenses, the shared library code, which is linked at runtime into the same address space as the client using it, is licensed under the terms of the \"Three-Clause BSD License\". The Linux Name Service Switch code, contributed by National ICT Australia Ltd (NICTA) is licensed under the terms of the NICTA Public Software Licence (which is substantially similar to the \"Three-Clause BSD License\", with some additional language pertaining to Australian law). Mozilla Public License Version 1.1 1. Definitions. 1.0.1. \"Commercial Use\" means distribution or otherwise making the Covered Code available to a third party. 1.1. \"Contributor\" means each entity that creates or contributes to the creation of Modifications. 1.2. \"Contributor Version\" means the combination of the Original Code, prior Modifications used by a Contributor, and the Modifications made by that particular Contributor. 1.3. \"Covered Code\" means the Original Code or Modifications or the combination of the Original Code and Modifications, in each case including portions thereof. 1.4. \"Electronic Distribution Mechanism\" means a mechanism generally accepted in the software development community for the electronic transfer of data. 1.5. \"Executable\" means Covered Code in any form other than Source Code. 1.6. \"Initial Developer\" means the individual or entity identified as the Initial Developer in the Source Code notice required by Exhibit A. 1.7. \"Larger Work\" means a work which combines Covered Code or portions thereof with code not governed by the terms of this License. 1.8. \"License\" means this document. 1.8.1. \"Licensable\" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently acquired, any and all of the rights conveyed herein. 1.9. \"Modifications\" means any addition to or deletion from the substance or structure of either the Original Code or any previous Modifications. When Covered Code is released as a series of files, a Modification is: Any addition to or deletion from the contents of a file containing Original Code or previous Modifications. Any new file that contains any part of the Original Code or previous Modifications. 1.10. \"Original Code\" means Source Code of computer software code which is described in the Source Code notice required by Exhibit A as Original Code, and which, at the time of its release under this License is not already Covered Code governed by this License. 1.10.1. \"Patent Claims\" means any patent claim(s), now owned or hereafter acquired, including without limitation, method, process, and apparatus claims, in any patent Licensable by grantor. 1.11. \"Source Code\" means the preferred form of the Covered Code for making modifications to it, including all modules it contains, plus any associated interface definition files, scripts used to control compilation and installation of an Executable, or source code differential comparisons against either the Original Code or another well known, available Covered Code of the Contributor's choice. The Source Code can be in a compressed or archival form, provided the appropriate decompression or de-archiving software is widely available for no charge. 1.12. \"You\" (or \"Your\") means an individual or a legal entity exercising rights under, and complying with all of the terms of, this License or a future version of this License issued under Section 6.1. For legal entities, \"You\" includes any entity which controls, is controlled by, or is under common control with You. For purposes of this definition, \"control\" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. Source Code License. 2.1. The Initial Developer Grant. The Initial Developer hereby grants You a world-wide, royalty-free, non-exclusive license, subject to third party intellectual property claims: under intellectual property rights (other than patent or trademark) Licensable by Initial Developer to use, reproduce, modify, display, perform, sublicense and distribute the Original Code (or portions thereof) with or without Modifications, and/or as part of a Larger Work; and under Patents Claims infringed by the making, using or selling of Original Code, to make, have made, use, practice, sell, and offer for sale, and/or otherwise dispose of the Original Code (or portions thereof). the licenses granted in this Section 2.1 (a) and (b) are effective on the date Initial Developer first distributes Original Code under the terms of this License. Notwithstanding Section 2.1 (b) above, no patent license is granted: 1) for code that You delete from the Original Code; 2) separate from the Original Code; or 3) for infringements caused by: i) the modification of the Original Code or ii) the combination of the Original Code with other software or devices. 2.2. Contributor Grant. Subject to third party intellectual property claims, each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license under intellectual property rights (other than patent or trademark) Licensable by Contributor, to use, reproduce, modify, display, perform, sublicense and distribute the Modifications created by such Contributor (or portions thereof) either on an unmodified basis, with other Modifications, as Covered Code and/or as part of a Larger Work; and under Patent Claims infringed by the making, using, or selling of Modifications made by that Contributor either alone and/or in combination with its Contributor Version (or portions of such combination), to make, use, sell, offer for sale, have made, and/or otherwise dispose of: 1) Modifications made by that Contributor (or portions thereof); and 2) the combination of Modifications made by that Contributor with its Contributor Version (or portions of such combination). the licenses granted in Sections 2.2 (a) and 2.2 (b) are effective on the date Contributor first makes Commercial Use of the Covered Code. Notwithstanding Section 2.2 (b) above, no patent license is granted: 1) for any code that Contributor has deleted from the Contributor Version; 2) separate from the Contributor Version; 3) for infringements caused by: i) third party modifications of Contributor Version or ii) the combination of Modifications made by that Contributor with other software (except as part of the Contributor Version) or other devices; or 4) under Patent Claims infringed by Covered Code in the absence of Modifications made by that Contributor. 3. Distribution Obligations. 3.1. Application of License. The Modifications which You create or to which You contribute are governed by the terms of this License, including without limitation Section 2.2. The Source Code version of Covered Code may be distributed only under the terms of this License or a future version of this License released under Section 6.1, and You must include a copy of this License with every copy of the Source Code You distribute. You may not offer or impose any terms on any Source Code version that alters or restricts the applicable version of this License or the recipients' rights hereunder. However, You may include an additional document offering the additional rights described in Section 3.5. 3.2. Availability of Source Code. Any Modification which You create or to which You contribute must be made available in Source Code form under the terms of this License either on the same media as an Executable version or via an accepted Electronic Distribution Mechanism to anyone to whom you made an Executable version available; and if made available via Electronic Distribution Mechanism, must remain available for at least twelve (12) months after the date it initially became available, or at least six (6) months after a subsequent version of that particular Modification has been made available to such recipients. You are responsible for ensuring that the Source Code version remains available even if the Electronic Distribution Mechanism is maintained by a third party. 3.3. Description of Modifications. You must cause all Covered Code to which You contribute to contain a file documenting the changes You made to create that Covered Code and the date of any change. You must include a prominent statement that the Modification is derived, directly or indirectly, from Original Code provided by the Initial Developer and including the name of the Initial Developer in (a) the Source Code, and (b) in any notice in an Executable version or related documentation in which You describe the origin or ownership of the Covered Code. 3.4. Intellectual Property Matters (a) Third Party Claims If Contributor has knowledge that a license under a third party's intellectual property rights is required to exercise the rights granted by such Contributor under Sections 2.1 or 2.2, Contributor must include a text file with the Source Code distribution titled \"LEGAL\" which describes the claim and the party making the claim in sufficient detail that a recipient will know whom to contact. If Contributor obtains such knowledge after the Modification is made available as described in Section 3.2, Contributor shall promptly modify the LEGAL file in all copies Contributor makes available thereafter and shall take other steps (such as notifying appropriate mailing lists or newsgroups) reasonably calculated to inform those who received the Covered Code that new knowledge has been obtained. (b) Contributor APIs If Contributor's Modifications include an application programming interface and Contributor has knowledge of patent licenses which are reasonably necessary to implement that API, Contributor must also include this information in the legal file. (c) Representations. Contributor represents that, except as disclosed pursuant to Section 3.4 (a) above, Contributor believes that Contributor's Modifications are Contributor's original creation(s) and/or Contributor has sufficient rights to grant the rights conveyed by this License. 3.5. Required Notices. You must duplicate the notice in Exhibit A in each file of the Source Code. If it is not possible to put such notice in a particular Source Code file due to its structure, then You must include such notice in a location (such as a relevant directory) where a user would be likely to look for such a notice. If You created one or more Modification(s) You may add your name as a Contributor to the notice described in Exhibit A. You must also duplicate this License in any documentation for the Source Code where You describe recipients' rights or ownership rights relating to Covered Code. You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Code. However, You may do so only on Your own behalf, and not on behalf of the Initial Developer or any Contributor. You must make it absolutely clear than any such warranty, support, indemnity or liability obligation is offered by You alone, and You hereby agree to indemnify the Initial Developer and every Contributor for any liability incurred by the Initial Developer or such Contributor as a result of warranty, support, indemnity or liability terms You offer. 3.6. Distribution of Executable Versions. You may distribute Covered Code in Executable form only if the requirements of Sections 3.1, 3.2, 3.3, 3.4 and 3.5 have been met for that Covered Code, and if You include a notice stating that the Source Code version of the Covered Code is available under the terms of this License, including a description of how and where You have fulfilled the obligations of Section 3.2. The notice must be conspicuously included in any notice in an Executable version, related documentation or collateral in which You describe recipients' rights relating to the Covered Code. You may distribute the Executable version of Covered Code or ownership rights under a license of Your choice, which may contain terms different from this License, provided that You are in compliance with the terms of this License and that the license for the Executable version does not attempt to limit or alter the recipient's rights in the Source Code version from the rights set forth in this License. If You distribute the Executable version under a different license You must make it absolutely clear that any terms which differ from this License are offered by You alone, not by the Initial Developer or any Contributor. You hereby agree to indemnify the Initial Developer and every Contributor for any liability incurred by the Initial Developer or such Contributor as a result of any such terms You offer. 3.7. Larger Works. You may create a Larger Work by combining Covered Code with other code not governed by the terms of this License and distribute the Larger Work as a single product. In such a case, You must make sure the requirements of this License are fulfilled for the Covered Code. 4. Inability to Comply Due to Statute or Regulation. If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Code due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be included in the legal file described in Section 3.4 and must be included with all distributions of the Source Code. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Application of this License. This License applies to code to which the Initial Developer has attached the notice in Exhibit A and to related Covered Code. 6. Versions of the License. 6.1. New Versions Netscape Communications Corporation (\"Netscape\") may publish revised and/or new versions of the License from time to time. Each version will be given a distinguishing version number. 6.2. Effect of New Versions Once Covered Code has been published under a particular version of the License, You may always continue to use it under the terms of that version. You may also choose to use such Covered Code under the terms of any subsequent version of the License published by Netscape. No one other than Netscape has the right to modify the terms applicable to Covered Code created under this License. 6.3. Derivative Works If You create or use a modified version of this License (which you may only do in order to apply it to code which is not already Covered Code governed by this License), You must (a) rename Your license so that the phrases \"Mozilla\", \"MOZILLAPL\", \"MOZPL\", \"Netscape\", \"MPL\", \"NPL\" or any confusingly similar phrase do not appear in your license (except to note that your license differs from this License) and (b) otherwise make it clear that Your version of the license contains terms which differ from the Mozilla Public License and Netscape Public License. (Filling in the name of the Initial Developer, Original Code or Contributor in the notice described in Exhibit A shall not of themselves be deemed to be modifications of this License.) 7. Disclaimer of warranty Covered code is provided under this license on an \"as is\" basis, without warranty of any kind, either expressed or implied, including, without limitation, warranties that the covered code is free of defects, merchantable, fit for a particular purpose or non-infringing. The entire risk as to the quality and performance of the covered code is with you. Should any covered code prove defective in any respect, you (not the initial developer or any other contributor) assume the cost of any necessary servicing, repair or correction. This disclaimer of warranty constitutes an essential part of this license. No use of any covered code is authorized hereunder except under this disclaimer. 8. Termination 8.1. This License and the rights granted hereunder will terminate automatically if You fail to comply with terms herein and fail to cure such breach within 30 days of becoming aware of the breach. All sublicenses to the Covered Code which are properly granted shall survive any termination of this License. Provisions which, by their nature, must remain in effect beyond the termination of this License shall survive. 8.2. If You initiate litigation by asserting a patent infringement claim (excluding declatory judgment actions) against Initial Developer or a Contributor (the Initial Developer or Contributor against whom You file such action is referred to as \"Participant\") alleging that: such Participant's Contributor Version directly or indirectly infringes any patent, then any and all rights granted by such Participant to You under Sections 2.1 and/or 2.2 of this License shall, upon 60 days notice from Participant terminate prospectively, unless if within 60 days after receipt of notice You either: (i) agree in writing to pay Participant a mutually agreeable reasonable royalty for Your past and future use of Modifications made by such Participant, or (ii) withdraw Your litigation claim with respect to the Contributor Version against such Participant. If within 60 days of notice, a reasonable royalty and payment arrangement are not mutually agreed upon in writing by the parties or the litigation claim is not withdrawn, the rights granted by Participant to You under Sections 2.1 and/or 2.2 automatically terminate at the expiration of the 60 day notice period specified above. any software, hardware, or device, other than such Participant's Contributor Version, directly or indirectly infringes any patent, then any rights granted to You by such Participant under Sections 2.1(b) and 2.2(b) are revoked effective as of the date You first made, used, sold, distributed, or had made, Modifications made by that Participant. 8.3. If You assert a patent infringement claim against Participant alleging that such Participant's Contributor Version directly or indirectly infringes any patent where such claim is resolved (such as by license or settlement) prior to the initiation of patent infringement litigation, then the reasonable value of the licenses granted by such Participant under Sections 2.1 or 2.2 shall be taken into account in determining the amount or value of any payment or license. 8.4. In the event of termination under Sections 8.1 or 8.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or any distributor hereunder prior to termination shall survive termination. 9. Limitation of liability Under no circumstances and under no legal theory, whether tort (including negligence), contract, or otherwise, shall you, the initial developer, any other contributor, or any distributor of covered code, or any supplier of any of such parties, be liable to any person for any indirect, special, incidental, or consequential damages of any character including, without limitation, damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses, even if such party shall have been informed of the possibility of such damages. This limitation of liability shall not apply to liability for death or personal injury resulting from such party's negligence to the extent applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion or limitation of incidental or consequential damages, so this exclusion and limitation may not apply to you. 10. U.S. government end users The Covered Code is a \"commercial item,\" as that term is defined in 48 C.F.R. 2.101 (Oct. 1995), consisting of \"commercial computer software\" and \"commercial computer software documentation,\" as such terms are used in 48 C.F.R. 12.212 (Sept. 1995). Consistent with 48 C.F.R. 12.212 and 48 C.F.R. 227.7202-1 through 227.7202-4 (June 1995), all U.S. Government End Users acquire Covered Code with only those rights set forth herein. 11. Miscellaneous This License represents the complete agreement concerning subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. This License shall be governed by California law provisions (except to the extent applicable law, if any, provides otherwise), excluding its conflict-of-law provisions. With respect to disputes in which at least one party is a citizen of, or an entity chartered or registered to do business in the United States of America, any litigation relating to this License shall be subject to the jurisdiction of the Federal Courts of the Northern District of California, with venue lying in Santa Clara County, California, with the losing party responsible for costs, including without limitation, court costs and reasonable attorneys' fees and expenses. The application of the United Nations Convention on Contracts for the International Sale of Goods is expressly excluded. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not apply to this License. 12. Responsibility for claims As between Initial Developer and the Contributors, each party is responsible for claims and damages arising, directly or indirectly, out of its utilization of rights under this License and You agree to work with Initial Developer and Contributors to distribute such responsibility on an equitable basis. Nothing herein is intended or shall be deemed to constitute any admission of liability. 13. Multiple-licensed code Initial Developer may designate portions of the Covered Code as \"Multiple-Licensed\". \"Multiple-Licensed\" means that the Initial Developer permits you to utilize portions of the Covered Code under Your choice of the MPL or the alternative licenses, if any, specified by the Initial Developer in the file described in Exhibit A. Exhibit A - Mozilla Public License. \"The contents of this file are subject to the Mozilla Public License Version 1.1 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.mozilla.org/MPL/ Software distributed under the License is distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the specific language governing rights and limitations under the License. The Original Code is ______________________________________. The Initial Developer of the Original Code is ________________________. Portions created by ______________________ are Copyright (C) ______ _______________________. All Rights Reserved. Contributor(s): ______________________________________. Alternatively, the contents of this file may be used under the terms of the _____ license (the \"[___] License\"), in which case the provisions of [______] License are applicable instead of those above. If you wish to allow use of your version of this file only under the terms of the [____] License and not to allow others to use your version of this file under the MPL, indicate your decision by deleting the provisions above and replace them with the notice and other provisions required by the [___] License. If you do not delete the provisions above, a recipient may use your version of this file under either the MPL or the [___] License.\" NOTE: The text of this Exhibit A may differ slightly from the text of the notices in the Source Code files of the Original Code. You should use the text of this Exhibit A rather than the text found in the Original Code Source Code for Your Modifications. Initial Developers In accordance with MPL section 3.3, we state that this software is derived, directly or indirectly, from Original Code provided by some or all of the following people, companies and organisations: Aaron Leventhal, Aaron Nowack, Aaron Schulman, Aaron Train, ActiveState Tool Corp, Adam Barth, Adam Christian, Adobe System Incorporated, Akkana Peck, Alex Fritze, Alexander J. Vincent, Alfred Peng, Andreas Gal, Andreas Otte, Andrew Thompson, Andrew Zabolotny, Anirvana Mishra, ArentJan Banck, Arpad Borsos, Asaf Romano, Axel Hecht, Ben Bucksch, Ben Goodger, Ben Turner, Ben Willmore, Benjamin Smedberg, Berend Cornelius, Bernd Mielke, Björn Jacke, Blake Ross, Blue Static, Bob Moss, Boris Zbarsky, Brad Lassey, Bradley Baetz, Brendan Eich, Brian Birtles, Brian Bober, Brian Crowder, Brian Ryner, Bruce Davidson, Bruno Browning, Bruno Escherl, Bruno Haible, Bryan Atwood, Caio Tiago Oliveira, Calum Robinson, Caolan McNamara, Chinmay Deepakbhai Patel, Chris Double, Chris Jones, Chris McAfee, Christian Biesinger, Christopher A. Aillon, Christopher Blizzard, Christopher Henderson, Christopher Hoess, Christopher Seawood, Collabora Ltd, Craig Topper, Crocodile Clips Ltd, CSIRO, Cyrus Patel, Dão Gottwald, Dainis Jonitis, Dan Mosedale, Daniel Aquino, Daniel Boelzle, Daniel Brooks, Daniel Glazman, Daniel Kouril, Daniel Weber, Daniel Witte, Dantifer Dang, Darin Fisher, Dave Liebreich, Dave Townsend, David Ascher, David Bienvenu, David Bradley, David Einstein, David Hamp-Gonsalves, David Hyatt, David P. Caldwell, Diane Trout, Dietrich Ayala, Digital Creations 2 Inc, Disruptive Innovations SARL, Doron Rosenberg, Doug Turner, Edward Lee, Ehsan Akhgari, Elika J. Etemad, Eric Belhaire, Eric Hedekar, Eric Hodel, Esben Mose Hansen, Evan Stratford, Fidesfit, Florian Queze, Frank Schönheit, Fred Jendrzejewski, Frederic Wang, Fredrik Holmqvist, Gavin Sharp, Geoff Beier, Gervase Markham, Gijs Kruitbosch, Giorgio Maone, Google Inc, Graeme McCutcheon, HÃ¥kan Waara, Heriot-Watt University, Hewlett-Packard Company, i-DNS.net International, Ian Hickson, Ian Leue, Ian Neal, Ian Oeschger, IBM Corporation, Igor Bukanov, InnoTek Systemberatung GmbH, Intel Corporation, James Boston, James L. Nance, Jamie Zawinski, Jan Varga, Jan Wrobel, Jason Barnabe, Jason Orendorff, Jason Oster, Jean-Francois Ducarroz, Jeff Dlouhy, Jeff Tsai, Jeff Walden, Jim Blandy, Jim Mathies, Joe Hewitt, Joel Maher, Joey Minta, John B. Keiser, John C. Griggs, John Fairhurst, John Morkel, John Wolfe, Jonas Sicking, Jonathan Protzenko, Jonathan Watt, Josh Aas, Josh Geenen, Joshua Cranmer, Juan Lang, Jungshik Shin, Jussi Kukkonen, Justin Lebar, Karsten Düsterloh, Kathleen Brade, Keith Visco, Ken Herron, Kent James, Kevin Gerich, Kevin Hendricks, Kipp E.B. Hickman, KISA, Kuden, Kyle Huey, László Németh, L. David Baron, Lev Serebryakov, Magnus Melin, Makoto Kato, Marc Bevand, Marc Zahnlecker, Marco Pesenti Gritti, Mark 'Mook' Yen, Mark Banner, Mark Finkle, Mark Mentovai, Markus G. Kuhn, Markus Stange, Masatoshi Kimura, Mats Palmgren, Matt Judy, Matthew Willis, Merike Sell, Michael J. Fromberger, Michael Johnston, Michael Kohler, Michael Kraft, Michael Ventnor, Michal Ceresna, Michal Novotny, Michiel van Leeuwen, Mike Connor, Mike Pinkerton, Mike Potter, Mike Shaver, Mikeal Rogers, MIPS Technologies Inc, Mitchell Field, MITRE Corporation, Mozdev Group, Mozilla Corporation, Mozilla Foundation, Mozilla Japan, Mozilla Messaging, Ms2ger, Naoki Hotta, Neil Deakin, Neil Rashbrook, Nelson B. Bolyard, Netscape Communications Corporation, Nick Kreeger, Nickolay Ponomarev, Nils Maier, Nochum Sossonko, Nokia, Nokia Corporation, Novell Inc, NTT, NVIDIA Corporation, OEone Corporation, Oleg Romashin, Olivier Parniere, Olli Pettay, Oracle Corporation, Paolo Amadini, Pattara Kiatisevi, Paul Ashford, Paul Kocher, Paul Sandoz, Paul Tomlin, Peter Annema, Peter Van der Beken, Peter Weilbacher, Petr Kostka, Phil Lacy, Phil Ringnalda, Philip Chee, Philipp Kewisch, Philippe Wittenbergh, POTI Inc, Qualcomm Inc, R.J. Keller, Rajiv Dayal, Ramalingam Saravanan, Red Hat Inc, Rich Salz, Richard C. Swift, Richard L. Walsh, Richard Verhoeven, Rob Arnold, Robert Accettura, Robert Kaiser, Robert Longson, Robert O'Callahan, Robert Sayre, Robert Strong, Roland Mainz, RSA Security Inc, Ryan Cassin, Ryan VanderMeulen, Samphan Raruenrom, Samuel Sidler, Scooter Morris, Scott MacGregor, Sean Murphy, Sebastian Schwieger, Serge Gautherie, Sergei Dolgov, Seth Spitzer, Shailendra N Jain, Shawn Wilsher, SHIMODA Hiroshi, Shy Shalom, Siddharth Agarwal, Simdesk Technologies Inc, Simmule Turner, Simon Bünzli, Simon Fraser, Simon Montagu, Simon Paquet, Simon Wilkinson, Sindre Dammann, Smokey Ardisson, Sqlite Project, Srilatha Moturi, Stanford University, Stefan Sitter, Steffen Wilberg, Stephen Horlander, Steve Swanson, STMicroelectronics, Stuart Morgan, Stuart Parmenter, Sun Microsystems Inc, Sylvain Pasche, Ted Mielczarek, Theppitak Karoonboonyanan, Thomas K. Dyas, Tim Copperfield, Tim Rowley, Timothy Wall, Tom St Denis, University of Queensland, University of Southern California, Vee Satayamas, Vincent Béron, Vivien Nicolas, Vladimir Vukicevic, Wellington Fernando de Macedo, William Jon McCann, Wladimir Palant, Wolfgang Rosenauer, Zack Rusin, Zero-Knowledge Systems, Žiga Sancin. GNU General Public License Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) 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 this service 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 make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. 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. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The \"Program\", below, refers to any such program or work, and a \"work based on the Program\" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term \"modification\".) Each licensee is addressed as \"you\". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the 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 a version number of this License which applies to it and \"any later version\", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE 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. 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 convey 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a \"copyright disclaimer\" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This 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. GNU Lesser General Public License Version 2.1, February 1999 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the \"Lesser\" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a \"work based on the library\" and a \"work that uses the library\". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called \"this License\"). Each licensee is addressed as \"you\". A \"library\" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The \"Library\", below, refers to any such software library or work which has been distributed under these terms. A \"work based on the Library\" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term \"modification\".) \"Source code\" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a \"work that uses the Library\". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a \"work that uses the Library\" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a \"work that uses the library\". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a \"work that uses the Library\" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a \"work that uses the Library\" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable \"work that uses the Library\", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the \"work that uses the Library\" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and \"any later version\", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY \"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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a \"copyright disclaimer\" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ----------------------------------------------------------------------------------------------------------- cJSON-1.0.0 /* Copyright (c) 2009 Dave Gamble 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 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ ----------------------------------------------------------------------------------------------------------- MiniZip - unzip.h, unzip.cpp http://www.winimage.com/zLibDll/minizip.html Copied out of the source: unzip.cpp: /* unzip.h -- IO for uncompress .zip files using zlib Version 1.01h, December 28th, 2009 Copyright (C) 1998-2009 Gilles Vollant This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g WinZip, InfoZip tools and compatible. Multi volume ZipFile (span) are not supported. Encryption compatible with pkzip 2.04g only supported Old compressions used by old PKZip 1.x are not supported I WAIT FEEDBACK at mail info@winimage.com Visit also http://www.winimage.com/zLibDll/unzip.htm for evolution Condition of use and distribution are the same than zlib : This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ /* for more info about .ZIP format, see http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip http://www.info-zip.org/pub/infozip/doc/ PkWare has also a specification at : ftp://ftp.pkware.com/probdesc.zip */ unzip.h: /* unzip.c -- IO for uncompress .zip files using zlib Version 1.01h, December 28th, 2009 Copyright (C) 1998-2009 Gilles Vollant Read unzip.h for more info */ /* Decryption code comes from crypt.c by Info-ZIP but has been greatly reduced in terms of compatibility with older software. The following is from the original crypt.c. Code woven in by Terry Thorsen 1/2003. */ /* Copyright (c) 1990-2000 Info-ZIP. All rights reserved. See the accompanying file LICENSE, version 2000-Apr-09 or later (the contents of which are also included in zip.h) for terms of use. If, for some reason, all these files are missing, the Info-ZIP license also may be found at: ftp://ftp.info-zip.org/pub/infozip/license.html */ /* crypt.c (full version) by Info-ZIP. Last revised: [see crypt.h] The encryption/decryption parts of this source code (as opposed to the non-echoing password parts) were originally written in Europe. The whole source package can be freely distributed, including from the USA. (Prior to January 2000, re-export from the US was a violation of US law.) */ /* This encryption code is a direct transcription of the algorithm from Roger Schlafly, described by Phil Katz in the file appnote.txt. This file (appnote.txt) is distributed with the PKZIP program (even in the version without encryption capabilities). */ ----------------------------------------------------------------------------------------------------------- Boost http://bost.org License details, history and FAQ can be found at http://www.boost.org/users/license.html Boost Software License - Version 1.0 - August 17th, 2003 Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the \"Software\") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: The copyright notices in the Software and this entire statement, including the above license grant, this restriction and the following disclaimer, must be included in all copies of the Software, in whole or in part, and all derivative works of the Software, unless such copies or derivative works are solely in the form of machine-executable object code generated by a source language processor. 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Copyrights within the Boost package: Copyright (2) Beman Dawes 2010, 2011 lightweight_test.hpp, Copyright (2) Beman Dawes 2011 assert_test.cpp Copyright (c) 2010 Bryce Lelbach argument.hpp Copyright (c) 2011 Thomas Heller support_functions_expression.hpp, argument_phoenix.hpp, argument.hpp Copyright (C) 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) ref.hpp, ptr.hpp Copyright (c) 2000 boost_no_ptr_mem_const.ipp Copyright (c) 2000-2007 Joerg Walter, Mathias Koch, Gunter Winkler matrix_sparse.hpp Copyright (c) 2000-2009 Joerg Walter, Mathias Koch, Gunter Winkler functional.hpp Copyright (c) 2000-2010 Joerg Walter, Mathias Koch, David Bellot vector.hpp, io.hpp, hermitian.hpp, fwd.hpp Copyright (c) 2000-2010 Joerg Walter, Mathias Koch, Gunter Winkler, David Bellot matrix.hpp Copyright (c) 2000-2010 Joerg Walter, Mathias Koch. David Bellot expression_types.hpp Copyright (c) 2001 Daniel C. Nuffer split_std_deque_policy.hpp, ref_counted_policy.hpp, no_check_policy.hpp, multi_pass.hpp, lex_input_policy.hpp, istream_policy.hpp, input_iterator_policy.hpp, fixed_size_queue_policy.hpp, fixed_size_queue.hpp, buffering_input_iterator_policy.hpp Copyright (c) 2001 Darin Adler suffix.hpp Copyright (c) 2001 David Abrahams bind_test.cpp, bind_const_test.cpp, mem_fn.hpp, bind.hpp Copyright (C) 2001 Dietmar Kuehl errors.hpp Copyright (c) 2001 Peter Dimov and Multi Media Ltd. calling_conventions_mf.cpp, calling_conventions.cpp, mem_fn_void_test.cpp, mem_fn_stdcall_test.cpp, bind_stdcall_test.cpp, bind_stdcall_mf_test.cpp, bind_fastcall_mf_test.cpp, bind_visitor.cpp, bind_as_compose.cpp, mem_fn_vw.hpp, mem_fn_template.hpp, mem_fn_cc.hpp, bind_mf_cc.hpp, bind_mf2_cc.hpp, bind_cc.hpp Copyright (c) 2001 Peter Dimov suffix.hpp Copyright (C) 2001 Peter Dimov- ptr.hpp Copyright (c) 2001 Samuel Krempp krempp@crans.ens-cachan.fr bench_format.cpp Copyright (c) 2001-2003 John Maddock suffix.hpp Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd. bind_const_test.cpp, bind_template.hpp, bind.hpp Copyright (c) 2001-2005 Peter Dimov atomic_count_win32.hpp, atomic_count_solaris.hpp Copyright (c) 2001-2007 Joel de Guzman example.hpp Copyright (c) 2001-2008 Peter Dimov shared_ptr.hpp, shared_ptr.hpp Copyright (c) 2001-2009 Hartmut Kaiser translation_unit_skipper.h:, translation_unit_parser.h:, matlib.h:, word_count_functor.flex:, strip_comments.input: Copyright (c) 2001-2009 Peter Dimov operator_bool.hpp Copyright (c) 2001-2009, Hartmut Kaiser multi_pass.hpp Copyright (c) 2001-2010 Hartmut Kaiser hannibal.cpp, regression_multi_pass_parse.cpp, regression_multi_pass_error_handler.cpp, regression_repeat.cpp, regression_reorder.cpp, regression_one_element_sequence_attribute.cpp, regression_debug_optional.cpp, regression_clear.cpp, string_token_id.cpp, regression_word_count.cpp, regression_wide.cpp, regression_matlib_switch.cpp, regression_matlib_static.cpp, regression_file_iterator4.cpp, regression_file_iterator2.cpp, id_type_enum.cpp, auto_switch_lexerstate.cpp, regression_semantic_action_attribute.cpp, regression_real_scientific.cpp, regression_optional_double.cpp, pattern4.cpp, pattern1.cpp, case_handling3.cpp, case_handling2.cpp, case_handling1.cpp, auto3.cpp, auto2.cpp, auto.hpp, distinct.cpp, advance.cpp, test.hpp, subrule.cpp, confix.cpp, iter_pos_parser.cpp, flush_multi_pass.cpp, distinct.cpp, confix.cpp, real_generator.cpp, int_generator.cpp, multi_pass.cpp, qiexpr_parser.hpp, qiexpr_generator.hpp, parse_qiexpr_impl.hpp, parse_qiexpr.hpp, generate_qiexpr_impl.hpp, generate_qiexpr.hpp, component_names.hpp, parse_sexpr_impl.hpp, parse_sexpr.hpp, parse_qiexpr.cpp, parse_qi_test.cpp, input.txt:, generate_sexpr_to_ostream.cpp, input.txt:, generate_sexpr_to_ostream.cpp, generate_qiexpr.cpp, generate_qi_test.cpp, reorder_struct.cpp, key_value_sequence_ordered.cpp, key_value_sequence_empty_value.cpp, key_value_sequence.cpp, iter_pos_parser.cpp, iter_pos.hpp, display_attribute_type.hpp, display_attribute_type.cpp, custom_string.cpp, adapt_template_struct.cpp, word_count_lexer.cpp, word_count_functor.cpp, word_count.cpp, strip_comments_lexer.cpp, strip_comments.cpp, word_count_tokens.hpp, word_count_static.cpp, word_count_lexer_tokens.hpp, word_count_lexer_static.cpp, word_count_lexer_generate.cpp, word_count_generate.cpp, print_numbers.cpp, print_number_tokenids.cpp, example6.cpp, example5.cpp, example4.cpp, example3.cpp, example2.cpp, example1.cpp, example.hpp, custom_token_attribute.cpp, simple_columns_directive.hpp, simple_columns_directive.cpp, reorder_struct.cpp, quoted_strings.cpp, quick_start1.cpp, printf_style_double_format.cpp, key_value_sequence.cpp, escaped_string.cpp, basic_facilities.cpp, auto_facilities.cpp, primitives.hpp Copyright (c) 2001-2010 Hartmut Kaiser, Bryce Lelbach sexpr.hpp, generate_sexpr.hpp Copyright (c) 2001-2010 Joel de Guzman distinct.cpp, advance.cpp, parse_sexpr_impl.hpp, parse_sexpr.hpp Copyright (c) 2001-2011 Hartmut Kaiser test_manip_attr.hpp, test_attr.hpp, regression_transform_assignment.cpp, regression_container_attribute.cpp, regression_attr_with_action.cpp, regression_adapt_adt.cpp, pass_container3.cpp, pass_container2.cpp, pass_container1.cpp, parse_attr.cpp, match_manip_attr.cpp, auto.cpp, token_onetype.cpp, token_omit.cpp, token_moretypes.cpp, token_iterpair.cpp, test.hpp, state_switcher.cpp, set_token_value.cpp, semantic_actions.cpp, regression_syntax_error.cpp, regression_static_wide_6253.cpp, regression_matlib_generate_switch.cpp, regression_matlib_generate.cpp, regression_matlib_dynamic.cpp, regression_file_iterator3.cpp, regression_file_iterator1.cpp, regression_basic_lexer.cpp, lexertl5.cpp, lexertl4.cpp, lexertl3.cpp, lexertl2.cpp, lexertl1.cpp, lexer_state_switcher.cpp, wstream.cpp, uint_radix.cpp, tricky_alignment.cpp, test_manip_attr.hpp, test_attr.hpp, test.hpp, symbols3.cpp, symbols2.cpp, symbols1.cpp, stream.cpp, sequence2.cpp, sequence1.cpp, right_alignment.cpp, repeat2.cpp, repeat1.cpp, regression_const_real_policies.cpp, regression_adapt_adt.cpp, real3.cpp, real2.cpp, real1.cpp, plus.cpp, pattern3.cpp, pattern2.cpp, optional.cpp, omit.cpp, not_predicate.cpp, maxwidth.cpp, lit.cpp, list.cpp, left_alignment.cpp, lazy.cpp, kleene.cpp, int3.cpp, int2.cpp, int1.cpp, grammar.cpp, generate_attr.cpp, format_manip_attr.cpp, format_manip.cpp, eps.cpp, eol.cpp, encoding.cpp, duplicate.cpp, delimiter.cpp, debug.cpp, columns.cpp, char_class.cpp, char3.cpp, char2.cpp, char1.cpp, center_alignment.cpp, buffer.cpp, binary3.cpp, binary2.cpp, binary1.cpp, auto1.cpp, attribute.cpp, and_predicate.cpp, alternative2.cpp, alternative1.cpp, sexpr_output_test.cpp, german_floating_point.cpp, conjure_static_lexer_generate.cpp, conjure_static_lexer_generate.cpp, lexer_debug_support.cpp, flush_multi_pass.hpp, distinct.hpp, confix.hpp, qi.hpp, primitive.hpp, iter_pos.hpp, flush_multi_pass.hpp, operator.hpp, nonterminal.hpp, directive.hpp, distinct.hpp, karma.hpp, nonterminal.hpp, directive.hpp, confix.hpp, numeric_traits.hpp, multi_pass_wrapper.hpp, limits.hpp, ostream_iterator.hpp, multi_pass.hpp, look_ahead.hpp, istream_iterator.hpp, split_std_deque_policy.hpp, split_functor_input_policy.hpp, ref_counted_policy.hpp, no_check_policy.hpp, multi_pass.hpp, lex_input_policy.hpp, istream_policy.hpp, input_iterator_policy.hpp, functor_input_policy.hpp, fixed_size_queue_policy.hpp, fixed_size_queue.hpp, first_owner_policy.hpp, buffering_input_iterator_policy.hpp, buf_id_check_policy.hpp, scoped_enum_emulation.hpp, get_encoding.hpp, endian.hpp, attr_cast.hpp, meta_create.hpp, assert_msg.hpp, adapt_adt_attributes.hpp, parse_attr.hpp, nonterminal_fwd.hpp, match_auto.hpp, match.hpp, unused_skipper.hpp, enable_lit.hpp, attributes.hpp, attr_cast.hpp, meta_create.hpp, create_parser.hpp, auto.hpp, lex.hpp, tokenize_and_parse_attr.hpp, tokenize_and_parse.hpp, reference.hpp, qi.hpp, state_switcher.hpp, plain_tokenid_mask.hpp, plain_tokenid.hpp, plain_token.hpp, plain_raw_token.hpp, in_state.hpp, meta_compiler.hpp, lexer_type.hpp, lexer_static_lexertl.hpp, lexer_lexertl.hpp, lexer.hpp, token_def.hpp, terminals.hpp, support_functions_expression.hpp, support_functions.hpp, string_token_def.hpp, sequence.hpp, pass_flags.hpp, token.hpp, static_version.hpp, static_lexer.hpp, static_functor_data.hpp, semantic_action_data.hpp, position_token.hpp, lexer.hpp, iterator_tokenizer.hpp, iterator.hpp, functor_data.hpp, functor.hpp, lexer.hpp, char_token_def.hpp, action.hpp, domain.hpp, sequence_function.hpp, argument_phoenix.hpp, argument.hpp, karma.hpp, what.hpp, string.hpp, symbols.hpp, lit.hpp, stream.hpp, stream.hpp, ostream_iterator.hpp, format_manip_attr.hpp, format_manip.hpp, iterator_sink.hpp, format_manip_auto.hpp, format_manip.hpp, reference.hpp, phoenix_attributes.hpp, operator.hpp, sequence.hpp, plus.hpp, optional.hpp, not_predicate.hpp, list.hpp, kleene.hpp, and_predicate.hpp, alternative.hpp, numeric.hpp, uint.hpp, real_policies.hpp, real.hpp, int.hpp, real_utils.hpp, numeric_utils.hpp, bool_utils.hpp, bool_policies.hpp, bool.hpp, nonterminal.hpp, simple_trace.hpp, rule.hpp, nonterminal_fwd.hpp, grammar.hpp, parameterized.hpp, generator_binder.hpp, fcall.hpp, debug_handler_state.hpp, debug_handler.hpp, meta_compiler.hpp, generator.hpp, generate_attr.hpp, generate.hpp, format_auto.hpp, format.hpp, domain.hpp, directive.hpp, verbatim.hpp, upper_lower_case.hpp, strict_relaxed.hpp, right_alignment.hpp, repeat.hpp, omit.hpp, no_delimit.hpp, maxwidth.hpp, left_alignment.hpp, encoding.hpp, duplicate.hpp, delimit.hpp, columns.hpp, center_alignment.hpp, buffer.hpp, as.hpp, unused_delimiter.hpp, string_generate.hpp, string_compare.hpp, output_iterator.hpp, indirect_iterator.hpp, get_stricttag.hpp, get_casetag.hpp, generate_to.hpp, generate_auto.hpp, generate.hpp, fail_function.hpp, extract_from.hpp, enable_lit.hpp, default_width.hpp, attributes.hpp, as.hpp, alternative_function.hpp, delimit_out.hpp, delimit_flag.hpp, char.hpp, char_generator.hpp, char_class.hpp, char.hpp, binary.hpp, padding.hpp, binary.hpp, auxiliary.hpp, lazy.hpp, eps.hpp, eol.hpp, attr_cast.hpp, auto.hpp, meta_create.hpp, create_generator.hpp, auto.hpp, action.hpp Copyright (c) 2001-2011 Joel de Guzman encoding.cpp, debug.cpp, qi.hpp, primitive.hpp, operator.hpp, nonterminal.hpp, directive.hpp, distinct.hpp, karma.hpp, nonterminal.hpp, subrule.hpp, directive.hpp, get_encoding.hpp, parse_attr.hpp, attributes.hpp, tokenize_and_parse_attr.hpp, reference.hpp, meta_compiler.hpp, lexer_type.hpp, domain.hpp, argument.hpp, reference.hpp, sequence.hpp, plus.hpp, optional.hpp, not_predicate.hpp, list.hpp, kleene.hpp, and_predicate.hpp, alternative.hpp, simple_trace.hpp, rule.hpp, grammar.hpp, parameterized.hpp, generator_binder.hpp, fcall.hpp, debug_handler.hpp, meta_compiler.hpp, generator.hpp, domain.hpp, upper_lower_case.hpp, repeat.hpp, encoding.hpp, get_casetag.hpp, fail_function.hpp, attributes.hpp, alternative_function.hpp, char_generator.hpp, lazy.hpp Copyright (c) 2001-2011 Thomas Bernard kwd.hpp Copyright (c) 2001-2012 Hartmut Kaiser regression_center_alignment.cpp, subrule.hpp, combine_policies.hpp Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd. shared_ptr_basic_test.cpp, shared_ptr_test.cpp, mem_fn_test.cpp, mem_fn_rv_test.cpp, mem_fn_derived_test.cpp, bind_test.cpp, atomic_count_pthreads.hpp, atomic_count_gcc.hpp, atomic_count.hpp, atomic_count.hpp, mem_fn.hpp, assert.hpp Copyright (c) 2001, 2002 Peter Dimov shared_array.hpp, scoped_ptr.hpp, scoped_array.hpp, intrusive_ptr.hpp, shared_ptr_nmt.hpp, shared_array_nmt.hpp, shared_array.hpp, shared_ptr_nmt_132.hpp, scoped_ptr.hpp, scoped_array.hpp, ref.hpp, intrusive_ptr.hpp Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. sp_counted_impl.hpp, sp_counted_base_w32.hpp, sp_counted_base_spin.hpp, sp_counted_base_solaris.hpp, sp_counted_base_pt.hpp, sp_counted_base_nt.hpp, sp_counted_base_gcc_x86.hpp, sp_counted_base_gcc_ppc.hpp, sp_counted_base_gcc_ia64.hpp, sp_counted_base_cw_x86.hpp, sp_counted_base_cw_ppc.hpp, sp_counted_base_aix.hpp, shared_count.hpp, bad_weak_ptr.hpp, shared_count_132.hpp, sp_counted_impl.hpp, sp_counted_base_atomic.hpp Copyright (c) 2001, 2002, 2003 Peter Dimov weak_ptr.hpp, weak_ptr.hpp, shared_ptr_132.hpp Copyright (c) 2001, Daniel C. Nuffer multi_pass.hpp, look_ahead.hpp, first_owner_policy.hpp, buf_id_check_policy.hpp Copyright (C) 2002 Beman Dawes errors.hpp Copyright (c) 2002 Bill Kempf suffix.hpp Copyright (c) 2002 by Andrei Alexandrescu move.hpp Copyright (C) 2002 David Abrahams ref.hpp Copyright (c) 2002 Jens Maurer suffix.hpp Copyright (c) 2002 Lars Gullik Bj%A%nnes atomic_count_gcc.hpp Copyright (c) 2002 Peter Dimov and Multi Media Ltd. verify_test.cpp, current_function_test.cpp, assert_test.cpp, weak_ptr_timing_test.cpp, weak_ptr_mt_test.cpp, shared_ptr_timing_test.cpp, shared_ptr_mt_test.cpp, shared_ptr_assign_fail.cpp, mem_fn_fastcall_test.cpp, bind_fastcall_test.cpp, throw_exception.hpp, lwm_pthreads.hpp, lwm_nop.hpp, lwm_pthreads.hpp, lwm_nop.hpp, throw_exception.hpp, lightweight_thread.hpp, current_function.hpp, protect.hpp, placeholders.hpp, make_adaptable.hpp, arg.hpp Copyright (c) 2002 Peter Dimov get_deleter_test.cpp, enable_shared_from_this.hpp Copyright (c) 2002-2003 Toon Knapen, Kresimir Fresl, Joerg Walter raw.hpp Copyright (c) 2002-2003 David Abrahams suffix.hpp Copyright (c) 2002-2003 Eric Friedman move.hpp Copyright (c) 2002-2005 Peter Dimov weak_ptr_test.cpp, intrusive_ptr_test.cpp, intrusive_ptr_move_test.cpp Copyright (c) 2002, 2003 Peter Dimov (C) Copyright Ion Gaztanaga 2005-2011. enable_shared_from_this_test.cpp Copyright (c) 2002, 2003 Peter Dimov and Multi Media Ltd. lightweight_mutex.hpp, mutex.hpp, lightweight_mutex.hpp, apply.hpp Copyright (c) 2002, 2003 Peter Dimov shared_ptr_test.cpp, shared_ptr_alloc_test.cpp, shared_from_this_test.cpp, sp_debug_hooks.cpp, sp_collector.cpp, lwm_win32_cs.hpp, lwm_win32_cs.hpp, checked_delete.hpp Copyright (c) 2002, 2009 Peter Dimov lightweight_test.hpp Copyright (c) 2002, 2011 Peter Dimov get_deleter_array_test.cpp Copyright (c) 2003 Gunter Winkler, Joerg Walter vector_of_vector.hpp Copyright (c) 2003 Daniel Frey checked_delete.hpp Copyright (c) 2003 David Abrahams quick_allocator.hpp, quick_allocator.hpp Copyright (c) 2003 Eric Friedman suffix.hpp Copyright (c) 2003 Gennaro Prota suffix.hpp Copyright (c) 2003 Howard Hinnant checked_delete.hpp Copyright (c) 2003 Institute of Transport, Railway Construction and Operation, University of Hanover, Germany main.cpp, test_a.h:, test_libx.h:, property_iter.cpp Copyright (c) 2003 Peter Dimov smart_ptr.hpp, collector_test.cpp, quick_allocator.hpp, quick_allocator.hpp Copyright (c) 2003 Vaclav Vesely distinct.cpp, distinct.hpp Copyright (c) 2003 Vladimir Prus foo.cpp, project-test4/lib/b.cpp, project-test4/a_gcc.cpp, project-test4/a.cpp, project-test3/lib3/f.cpp, project-test3/lib2/helper/e.cpp, project-test3/lib2/d.cpp, project-test3/lib2/c.cpp, project-test3/lib/b.cpp, project-test3/a.cpp, hello.cpp, a.h:, a.h:, a.cpp, generators-test/z.cpp, generators-test/lib/c.cpp, generators-test/e.cpp, generators-test/b.cxx:, generators-test/a.cpp, direct-request-test/b_inverse.cpp, direct-request-test/b.cpp, direct-request-test/a.cpp, dependency-test/src2/b.h:, dependency-test/src1/c.h:, dependency-test/src1/b.h:, dependency-test/src1/a.h:, dependency-test/e.cpp, dependency-test/c.cpp, dependency-test/b.cpp, dependency-test/a_c.c:, dependency-test/a.h:, dependency-test/a.cpp Copyright (c) 2003 Vladimir Prus. scoped_ptr.hpp Copyright (c) 2003-2005 Peter Dimov mem_fn.hpp Copyright (c) 2003-2010 Christopher M. Kohlhoff (chris at kohlhoff dot com) local_free_on_destruction.hpp Copyright (c) 2004 Beman Dawes equivalent.cpp, equivalent.cpp Copyright (c) 2004 Joao Abecasis shortest_alternative_tests.cpp Copyright (c) 2004 Peter Dimov mem_fn_eq_test.cpp, bind_stateful_test.cpp, bind_cv_test.cpp Copyright (c) 2004 Ralf Mattethat splaytree_algorithms.hpp Copyright (c) 2004, 2005 Peter Dimov bind_eq_test.cpp Copyright (c) 2004, 2005, 2009 Peter Dimov bind_eq3_test.cpp, bind_eq2_test.cpp Copyright (c) 2005 Carl Barron. xml_g.hpp, tag.hpp, actions.hpp Copyright (c) 2005 Ion Gaztanaga pointer_cast_test.cpp Copyright (c) 2005 Jo%A%o Abecasis text_diff.cpp Copyright (c) 2005 Joao Abecasis grammar_def_test.cpp Copyright (c) 2005 Peter Dimov shared_ptr_alloc2_test.cpp, pointer_to_other_test.cpp, pointer_cast_test.cpp, mem_fn_rv_test.cpp, mem_fn_dm_test.cpp, mem_fn_cdecl_test.cpp, bind_unary_addr.cpp, bind_rv_sp_test.cpp, bind_rel_test.cpp, bind_not_test.cpp, bind_function_test.cpp, bind_dm_test.cpp, bind_dm3_test.cpp, bind_dm2_test.cpp, bind_cdecl_mf_test.cpp, bind.hpp Copyright (c) 2005 Peter Dimov. pointer_to_other.hpp Copyright (c) 2005-2006 Danny Havenith translation_unit_skipper.h:, translation_unit_parser.h:, hannibal.cpp Copyright (c) 2005-2010 Hartmut Kaiser sequence_performance.cpp, high_resolution_timer.hpp, high_resolution_timer.hpp Copyright (c) 2005, 2008 Peter Dimov bind_mf2_test.cpp, bind_fnobj2_test.cpp, bind_fn2_test.cpp Copyright (c) 2006 Ion Gaztanaga shared_ptr_test.cpp Copyright (c) 2006 Joao Abecasis mix_and_match_trees.cpp Copyright (c) 2006 John Maddock ellint_rj_data.ipp, ellint_rf_data.ipp, ellint_rd_data.ipp, ellint_rc_data.ipp, ellint_pi3_large_data.ipp, ellint_pi3_data.ipp, ellint_pi2_data.ipp, ellint_f_data.ipp, ellint_e_data.ipp, ellint_e2_data.ipp, ellint_3.hpp, ellint_2.hpp, ellint_1.hpp Copyright (c) 2006 Michael van der Westhuizen atomic_count_solaris.hpp Copyright (c) 2006 Peter Dimov auto_ptr_rv_test.cpp, bind_rvalue_test.cpp, bind_placeholder_test.cpp, sp_counted_base_gcc_sparc.hpp, is_placeholder.hpp, storage.hpp Copyright (c) 2006 Piotr Wyderski sp_counted_base_gcc_sparc.hpp Copyright (c) 2006 Tomas Puverle sp_counted_base_gcc_sparc.hpp Copyright (C) 2006 Trustees of Indiana University Authors: Douglas Gregor and Jeremy Siek property_map.hpp Copyright (c) 2006 Xiaogang Zhang ellint_rj.hpp, ellint_rf.hpp, ellint_rd.hpp, ellint_rc.hpp, ellint_3.hpp, ellint_2.hpp, ellint_1.hpp, bessel_yn.hpp, bessel_y1.hpp, bessel_y0.hpp, bessel_kn.hpp, bessel_k1.hpp, bessel_k0.hpp, bessel_jy.hpp, bessel_jn.hpp, bessel_j1.hpp, bessel_j0.hpp, bessel_ik.hpp, bessel_i1.hpp, bessel_i0.hpp Copyright (c) 2006-2008 Johan Rade fpclassify.hpp Copyright (c) 2006-7 John Maddock workaround.hpp, config.hpp Copyright (c) 2006, Stephan Diederich read_dimacs.html: Copyright (C) 2007 Douglas Gregor boost_no_variadic_templates.ipp, boost_no_static_assert.ipp, boost_no_rvalue_references.ipp, boost_has_variadic_tmpl.ipp, boost_has_static_assert.ipp, boost_has_rvalue_refs.ipp Copyright (c) 2007 John Maddock bessel_data.cpp, sph_neumann_data.ipp, sph_bessel_data.ipp, bessel_yv_data.ipp, bessel_yn_data.ipp, bessel_y01_data.ipp, bessel_k_int_data.ipp, bessel_k_data.ipp, bessel_j_large_data.ipp, bessel_j_int_data.ipp, bessel_j_data.ipp, bessel_i_int_data.ipp, bessel_i_data.ipp, sin_pi.hpp, bessel_jy_asym.hpp, cos_pi.hpp, bessel.hpp Copyright (c) 2007 Peter Dimov verify_test.cpp, weak_ptr_move_test.cpp, sp_unary_addr_test.cpp, shared_ptr_rv_test.cpp, shared_ptr_move_test.cpp, shared_ptr_alias_test.cpp, sp_counted_base_sync.hpp, assert.hpp Copyright (c) 2007, 2008 Peter Dimov make_shared.hpp, deconstruct.hpp, make_shared.hpp Copyright (c) 2008 Frank Mori Hess owner_less_test.cpp, esft_constructor_test.cpp, owner_less.hpp, mutex.hpp, lwm_win32_cs.hpp, lwm_pthreads.hpp, lwm_nop.hpp Copyright (c) 2008 Michael Marcin deconstruct.hpp Copyright (C) 2008 N. Musatti boost_no_typename_with_ctor.ipp, boost_no_nested_friendship.ipp Copyright (c) 2008 Peter Dimov test_thread_mf.cpp, wp_convertible_test.cpp, sp_convertible_test.cpp, sp_atomic_test.cpp, shared_ptr_mt_test.cpp, ip_convertible_test.cpp, esft_regtest.cpp, esft_constructor_test.cpp, ref_fn_test.cpp, bind_and_or_test.cpp, yield_k.hpp, spinlock_w32.hpp, spinlock_sync.hpp, spinlock_pt.hpp, spinlock_pool.hpp, spinlock_nt.hpp, spinlock.hpp, lightweight_thread.hpp, bind_mf2_cc.hpp Copyright (c) 2008-2009 Ben Hanson generate_static.hpp Copyright (c) 2008-2009 Emil Dotchevski and Reverge Studios, Inc. throw_exception.hpp Copyright (c) 2008-2009 Frank Mori Hess signals2.hpp Copyright (c) 2008-2011 Hartmut Kaiser generate_static.hpp Copyright (c) 2008, 2009 Peter Dimov addressof_fn_test.cpp, sp_has_sync.hpp, memory_order.hpp Copyright (c) 2008, 2011 Peter Dimov spinlock_gcc_arm.hpp Copyright (c) 2009 Edward Grace high_resolution_timer.hpp, high_resolution_timer.hpp Copyright (c) 2009 Gunter Winkler sparse_view.hpp Copyright (C) 2009 Andrey Semashev boost_no_auto_multidecl.ipp, boost_no_auto_declarations.ipp Copyright (c) 2009 Carl Barron set_token_value_phoenix.cpp, regression_matlib_switch.cpp, regression_matlib_static.cpp, regression_matlib_generate_switch.cpp, regression_matlib_generate.cpp, regression_matlib_dynamic.cpp, matlib.h:, dedent_handling_phoenix.cpp, parse_attr.hpp, tokenize_and_parse_attr.hpp Copyright (c) 2009 Chris Hoeppler confix.cpp, confix.hpp Copyright (c) 2009 Edward Grace high_resolution_timer.hpp:, high_resolution_timer.hpp: Copyright (c) 2009 Francois Barel subrule.cpp, nonterminal.hpp, nonterminal.hpp, subrule.hpp, parameterized.hpp Copyright (c) 2009 Frank Mori Hess deconstruct.hpp Copyright (c) 2009 Jean-Francois Ostiguy regression_syntax_error.cpp Copyright (c) 2009 John Maddock iconv.hpp Copyright (c) 2009 Pavel Baranov regression_basic_lexer.cpp Copyright (c) 2009 Peter Dimov mem_fn_unary_addr_test.cpp, mem_fn_ref_test.cpp, bind_ref_test.cpp, mem_fn.hpp, bind.hpp Copyright (c) 2009 Steven Watanabe protect_test.cpp, find_format_test.cpp, protect.hpp Copyright (c) 2009 Tor Brede Vekterli regression_word_count.cpp Copyright (C) 2009 Trustees of Indiana University Authors: Jeremiah Willcock, Andrew Lumsdaine shared_array_property_map.hpp Copyright (c) 2009-2011 Artyom Beilis (Tonkikh) test_winapi_formatting.cpp, test_winapi_convert.cpp, test_winapi_collate.cpp, test_utf.cpp, test_std_formatting.cpp, test_std_convert.cpp, test_std_collate.cpp, test_posix_tools.hpp, test_posix_formatting.cpp, test_posix_convert.cpp, test_posix_collate.cpp, test_message.cpp, test_locale_tools.hpp, test_locale.hpp, test_ios_prop.cpp, test_icu_vs_os_timezone.cpp, test_generator.cpp, test_formatting.cpp, test_date_time.cpp, test_convert.cpp, test_config.cpp, test_collate.cpp, test_codepage_converter.cpp, test_codepage.cpp, test_boundary.cpp, win_backend.hpp, win_backend.cpp, numeric.cpp, lcid.hpp, lcid.cpp, converter.cpp, collate.cpp, api.hpp, all_generator.hpp, timezone.hpp, numeric.hpp, locale_data.hpp, locale_data.cpp, info.cpp, iconv.hpp, gregorian.hpp, gregorian.cpp, default_locale.cpp, codecvt_converter.cpp, std_backend.hpp, std_backend.cpp, numeric.cpp, converter.cpp, collate.cpp, codecvt.cpp, all_generator.hpp, mo_lambda.hpp, mo_lambda.cpp, mo_hash.hpp, message.cpp, localization_backend.cpp, ios_prop.hpp, ids.cpp, generator.cpp, formatting.cpp, format.cpp, date_time.cpp, posix_backend.hpp, posix_backend.cpp, numeric.cpp, converter.cpp, collate.cpp, codecvt.hpp, codecvt.cpp, all_generator.hpp, uconv.hpp, time_zone.hpp, time_zone.cpp, numeric.cpp, icu_util.hpp, icu_backend.hpp, icu_backend.cpp, formatter.hpp, formatter.cpp, date_time.cpp, conversion.cpp, collator.cpp, codecvt.hpp, codecvt.cpp, cdata.hpp, boundary.cpp, all_generator.hpp, wconv_codepage.ipp, uconv_codepage.ipp, iconv_codepage.ipp, conv.hpp, codepage.cpp, perf_format.cpp, perf_convert.cpp, perf_collate.cpp, whello.cpp, wconversions.cpp, wboundary.cpp, hello.cpp, conversions.cpp, collate.cpp, calendar.cpp, boundary.cpp, working_with_multiple_locales.txt:, using_localization_backends.txt:, using_boost_locale.txt:, tested_compilers_and_paltforms.txt:, std_locales.txt:, status_of_cpp0x_characters_support.txt:, special_thanks.txt:, running_examples_under_windows.txt:, recommendations_and_myths.txt:, rationale.txt:, messages_formatting.txt:, main.txt:, localized_text_formatting.txt:, locale_information.txt:, locale_gen.txt:, glossary.txt:, gettext_for_windows.txt:, formatting_and_parsing.txt:, faq.txt:, default_encoding_under_windows.txt:, dates_times_timezones.txt:, conversions.txt:, collation.txt:, charset_handling.txt:, building_boost_locale.txt:, boundary_analysys.txt:, appendix.txt:, option.cpp, has_iconv.cpp, locale.hpp, util.hpp, utf.hpp, time_zone.hpp, message.hpp, localization_backend.hpp, info.hpp, gnu_gettext.hpp, generator.hpp, formatting.hpp, format.hpp, encoding_utf.hpp, encoding_errors.hpp, encoding.hpp, definitions.hpp, date_time_facet.hpp, date_time.hpp, conversion.hpp, config.hpp, collator.hpp, boundary.hpp, types.hpp, segment.hpp, index.hpp, facets.hpp, boundary_point.hpp Copyright (c) 2009, Spirent Communications, Inc. sp_counted_base_gcc_mips.hpp Copyright (c) 2010 David Bellot doxydoc.hpp Copyright (c) 2010 Artyom Beilis (Tonkikh) hold_ptr.hpp Copyright (c) 2010 Athanasios Iliopoulos test_assignment.cpp, assignment_examples.cpp, assignment_bench.cpp, assignment.hpp Copyright (c) 2010 Beman Dawes local_free_on_destruction.hpp Copyright (c) 2010 Carl Philipp Reh regression_debug_optional.cpp Copyright (c) 2010 Chris Hoeppler regression_multi_pass_position_iterator.cpp Copyright (c) 2010 Daniel James regression_clear.cpp, regression_attr_with_action.cpp Copyright (C) 2010 Edward Diener boost_no_variadic_macros.ipp Copyright (c) 2010 Eric Jourdanneau, Joel Falcou suffix.hpp Copyright (c) 2010 Head Geek regression_repeat.cpp Copyright (c) 2010 Jeroen Habraken unescaped_string.cpp Copyright (c) 2010 Josh Wilson regression_one_element_sequence_attribute.cpp Copyright (c) 2010 Larry Evans regression_multi_pass_functor.cpp Copyright (c) 2010 Lars Kielhorn regression_real_scientific.cpp Copyright (c) 2010 Mathias Gaunard regression_file_iterator4.cpp, regression_file_iterator3.cpp, regression_file_iterator2.cpp, regression_file_iterator1.cpp, id_type_enum.cpp, auto_switch_lexerstate.cpp Copyright (c) 2010 Michael Caisse regression_semantic_action_attribute.cpp Copyright (c) 2010 Neil Groves safe_bool.hpp Copyright (c) 2010 Olaf Peter regression_reorder.cpp, regression_optional_double.cpp Copyright (c) 2010 Peter Schueller regression_multi_pass_parse.cpp Copyright (c) 2010 Sergey \"GooRoo\" Olendarenko regression_wide.cpp Copyright (c) 2010, Trustees of Indiana University read_dimacs.html: Copyright (c) 2011 Aaron Graham advance.cpp, advance.cpp, advance.hpp Copyright (c) 2011 Bryce Lelbach regression_numeric_alternatives.cpp Copyright (c) 2011 Colin Rundel regression_adapt_adt.cpp Copyright (c) 2011 Dean Michael Berries regression_transform_assignment.cpp Copyright (c) 2011 Jan Frederick Eick uint_radix.cpp Copyright (c) 2011 Jeroen Habraken regression_const_real_policies.cpp Copyright (c) 2011 Joerg Becker regression_container_attribute.cpp Copyright (c) 2011 John Maddock boost_no_unified_init.ipp, big_constant.hpp, bessel_jy_series.hpp Copyright (c) 2011 Laurent Gomila regression_multi_pass_error_handler.cpp Copyright (c) 2011 Michael Caisse german_floating_point.cpp Copyright (c) 2011 Roji Philip regression_adapt_adt.cpp Copyright (c) 2011 Ryan Molden regression_static_wide_6253.cpp Copyright (C) 2011 Takaya Saito boost_no_noexcept.ipp Copyright (c) 2011 Thomas Bernard operator.hpp Copyright (c) 2012 yyyy yyyy regression_center_alignment.cpp Copyright (c) Beman Dawes 2011 assert.hpp Copyright (C) Christof Meerwald 2003 digitalmars.hpp Copyright (C) Dan Watkins 2003 digitalmars.hpp Copyright (C) Douglas Gregor 2001-2005. function_test_fail2.cpp, function_test_fail1.cpp Copyright (C) Douglas Gregor 2008 function_typeof.hpp, function_fwd.hpp Copyright (C) Joaquin M Lopez Munoz 2004. boost_no_mem_tem_pnts.ipp Copyright (C) John Maddock 2005. aligned_storage.hpp Copyright 1999-2003 Aleksey Gurtovoy. utility.hpp Copyright 2000 John Maddock (john@johnmaddock.co.uk) is_function.hpp, function_traits.hpp, is_function_ptr_helper.hpp Copyright 2001 Aleksey Gurtovoy. transform_traits_spec.hpp Copyright 2001 Dietmar Kuehl operations.cpp, v2_operations.cpp, operations.hpp Copyright 2001-2003 Aleksey Gurtovoy. broken_compiler_spec.hpp Copyright 2001, 2003 Daryle Walker. base_from_member_test.cpp Copyright 2001, 2003, 2004 Daryle Walker. crc_test.cpp, base_from_member.hpp Copyright 2001, 2004 Daryle Walker. crc.hpp Copyright 2002 Aleksey Gurtovoy (agurtovoy@meta-comm.com) is_function.hpp, is_function_ptr_helper.hpp Copyright 2002 Daryle Walker. io_fwd.hpp Copyright 2002 Jan Langer operations.hpp Copyright 2002-2005 Beman Dawes portability.cpp, v2_portability.cpp, v2_operations.cpp, operations.hpp Copyright 2002-2009 Beman Dawes operations.cpp Copyright 2002, 2003 Daryle Walker. ios_state_test.cpp Copyright 2002, 2005 Daryle Walker. ios_state.hpp Copyright 2002, 2009 Peter Dimov enable_shared_from_this2.hpp, enable_shared_from_this.hpp Copyright 2003 Daryle Walker. ios_state_unit_test.cpp, crc_example.cpp Copyright 2003-2005 Peter Dimov atomic_count_gcc.hpp Copyright 2004-2005 Peter Dimov sp_counted_impl.hpp, sp_counted_base_w32.hpp, sp_counted_base_solaris.hpp, sp_counted_base_pt.hpp, sp_counted_base_nt.hpp, sp_counted_base_gcc_x86.hpp, sp_counted_base_gcc_ppc.hpp, sp_counted_base_cw_x86.hpp, sp_counted_base_cw_ppc.hpp, sp_counted_base_aix.hpp, shared_count.hpp, sp_counted_impl.hpp, sp_counted_base_atomic.hpp Copyright 2004-2006 Peter Dimov sp_counted_base_gcc_ia64.hpp Copyright 2004-2008 Peter Dimov sp_counted_base_spin.hpp Copyright 2005 Beman Dawes v2_path.cpp Copyright 2005 Ben Hutchings sp_counted_base_gcc_ia64.hpp Copyright 2005 Daniel Egloff, Eric Niebler. weighted_variance.hpp, variance.hpp Copyright 2005 Daniel Egloff, Olivier Gygi. p_square_cumulative_distribution.hpp Copyright 2005 Daniel Egloff. weighted_p_square_quantile.hpp, weighted_extended_p_square.hpp, p_square_quantile.hpp, extended_p_square_quantile.hpp, extended_p_square.hpp Copyright 2005 Eric Niebler, Daniel Egloff. value_accumulator.hpp Copyright 2005 Eric Niebler, Michael Gauckler. tail_variate.hpp, tail.hpp Copyright 2005 Eric Niebler. main.cpp, statistics_fwd.hpp, statistics.hpp, with_error.hpp, covariate.hpp, sum.hpp, stats.hpp, quantile_probability.hpp, moment.hpp, min.hpp, mean.hpp, max.hpp, error_of_mean.hpp, error_of.hpp, count.hpp, functional_fwd.hpp, functional.hpp, vector.hpp, valarray.hpp, complex.hpp, weights.hpp, weight.hpp, sample.hpp, accumulator.hpp, features.hpp, extractor.hpp, external.hpp, depends_on.hpp, reference_accumulator.hpp, external_accumulator.hpp, droppable_accumulator.hpp, accumulator_set.hpp, accumulator_concept.hpp, accumulator_base.hpp, accumulators_fwd.hpp, accumulators.hpp Copyright 2005 Peter Dimov weak_ptr_timing_test.cpp, shared_ptr_delete_fail.cpp, contains2_test.cpp, function_equal.hpp, interlocked.hpp Copyright 2005 Rene Rivera sp_counted_base_cw_x86.hpp Copyright 2005, 2006 Peter Dimov sp_counted_base.hpp Copyright 2005, 2008 Peter Dimov weak_ptr_mt_test.cpp Copyright 2006 Ion Gaztanaga sp_counted_impl.hpp Copyright 2006 Daniel Egloff, Olivier Gygi. weighted_tail_variate_means.hpp, weighted_tail_quantile.hpp, weighted_tail_mean.hpp, weighted_peaks_over_threshold.hpp, weighted_p_square_cumulative_distribution.hpp, weighted_density.hpp, weighted_covariance.hpp, tail_variate_means.hpp, tail_quantile.hpp, tail_mean.hpp, pot_tail_mean.hpp, pot_quantile.hpp, peaks_over_threshold.hpp, density.hpp, covariance.hpp Copyright 2006 Eric Niebler, Olivier Gygi. weighted_sum.hpp, weighted_median.hpp, weighted_mean.hpp, median.hpp Copyright 2006 Eric Niebler. times2_iterator.hpp Copyright 2006 John Maddock Copyright Paul A. Bristow 2007. test_carlson.cpp Copyright 2006 Michael van der Westhuizen sp_counted_base_solaris.hpp, sp_counted_base_aix.hpp Copyright 2006 Olivier Gygi, Daniel Egloff. weighted_skewness.hpp, weighted_kurtosis.hpp, skewness.hpp, kurtosis.hpp Copyright 2006 Peter Dimov shared_ptr_compare_fail.cpp Copyright 2006, Eric Niebler, Olivier Gygi. weighted_moment.hpp Copyright 2007 Baruch Zilber sp_counted_base_acc_ia64.hpp Copyright 2007 Boris Gubenko sp_counted_base_acc_ia64.hpp Copyright 2007 David Jenkins. symbols.hpp Copyright 2007 Eric Niebler. symbols.hpp Copyright 2007 Peter Dimov shared_ptr_pv_fail.cpp, atomic_count_sync.hpp, atomic_count_gcc_x86.hpp Copyright 2007-2009 Peter Dimov make_shared_esft_test.cpp, allocate_shared_esft_test.cpp Copyright 2007-2011 Ion Gaztanaga sp_counted_base_atomic.hpp Copyright 2008 Beman Dawes ratio_test.cpp, common_type.hpp, si_physics.cpp, duration.hpp, xtime.cpp, timeval_demo.cpp, time2_demo_output.txt:, time2_demo.cpp, test_special_values.cpp, test_duration.cpp, test_clock2.cpp, test_clock.cpp, simulated_thread_interface_demo.cpp, saturating.cpp, runtime_resolution.cpp, miscellaneous.cpp, min_time_point.cpp, manipulate_clock_object.cpp, i_dont_like_the_default_duration_behavior.cpp, explore_limits.cpp, cycle_count.cpp, chrono_unit_test.cpp, common_type.hpp, ratio_fwd.hpp, ratio.hpp, overflow_helpers.hpp, time_point.hpp, system_clocks.hpp, duration.hpp Copyright 2008 David Jenkins. test_symbols.cpp, as_action.hpp, attr_matcher.hpp, action_matcher.hpp Copyright 2008 Eric Niebler. test_format.cpp, test.hpp, deduce_domain.cpp, calculator.cpp, virtual_member.cpp, vector.cpp, vec3.cpp, tarray.cpp, rgb.cpp, mixed.cpp, map_assign.cpp, lazy_vector.cpp, futures.cpp, calc1.cpp, xpressive_typeof.hpp, xpressive_static.hpp, xpressive_fwd.hpp, xpressive_dynamic.hpp, xpressive.hpp, null_regex_traits.hpp, c_ctype.hpp, cpp_regex_traits.hpp, c_regex_traits.hpp, sub_match.hpp, regex_traits.hpp, regex_token_iterator.hpp, regex_primitives.hpp, regex_iterator.hpp, regex_error.hpp, regex_constants.hpp, regex_compiler.hpp, regex_algorithms.hpp, regex_actions.hpp, match_results.hpp, width.hpp, traits_utils.hpp, tracking_ptr.hpp, sequence_stack.hpp, save_restore.hpp, never_true.hpp, literals.hpp, ignore_unused.hpp, hash_peek_bitset.hpp, dont_care.hpp, cons.hpp, chset.hpp, boyer_moore.hpp, any.hpp, algorithm.hpp, width_of.hpp, visitor.hpp, type_traits.hpp, transmogrify.hpp, as_set.hpp, as_sequence.hpp, as_quantifier.hpp, as_modifier.hpp, as_matcher.hpp, as_marker.hpp, as_inverse.hpp, as_independent.hpp, as_alternate.hpp, static.hpp, placeholders.hpp, modifier.hpp, is_pure.hpp, grammar.hpp, compile.hpp, sequence.hpp, parser_traits.hpp, parser_enum.hpp, parser.hpp, parse_charset.hpp, matchable.hpp, dynamic.hpp, detail_fwd.hpp, sub_match_vector.hpp, sub_match_impl.hpp, state.hpp, results_cache.hpp, regex_impl.hpp, quant_style.hpp, peeker.hpp, optimize.hpp, matchers.hpp, true_matcher.hpp, string_matcher.hpp, simple_repeat_matcher.hpp, set_matcher.hpp, repeat_end_matcher.hpp, repeat_begin_matcher.hpp, regex_matcher.hpp, regex_byref_matcher.hpp, range_matcher.hpp, predicate_matcher.hpp, posix_charset_matcher.hpp, optional_matcher.hpp, mark_matcher.hpp, mark_end_matcher.hpp, mark_begin_matcher.hpp, lookbehind_matcher.hpp, lookahead_matcher.hpp, logical_newline_matcher.hpp, literal_matcher.hpp, keeper_matcher.hpp, epsilon_matcher.hpp, end_matcher.hpp, charset_matcher.hpp, attr_end_matcher.hpp, attr_begin_matcher.hpp, assert_word_matcher.hpp, assert_line_base.hpp, assert_eos_matcher.hpp, assert_eol_matcher.hpp, assert_bos_matcher.hpp, assert_bol_matcher.hpp, any_matcher.hpp, alternate_matcher.hpp, alternate_end_matcher.hpp, linker.hpp, icase.hpp, flow_control.hpp, finder.hpp, adaptor.hpp, action.hpp, access.hpp, basic_regex.hpp, transform.hpp, when.hpp, pass_through.hpp, make.hpp, lazy.hpp, impl.hpp, fold_tree.hpp, fold.hpp, when.hpp:, when.hpp:, pass_through_impl.hpp:, make_gcc_workaround.hpp:, make.hpp:, lazy.hpp:, fold_impl.hpp:, default_function_impl.hpp:, construct_pod_funop.hpp:, construct_funop.hpp:, call.hpp:, pass_through_impl.hpp:, make_gcc_workaround.hpp:, make.hpp:, lazy.hpp:, fold_impl.hpp:, default_function_impl.hpp:, construct_pod_funop.hpp:, construct_funop.hpp:, call.hpp:, default.hpp, call.hpp, arg.hpp, traits.hpp, tags.hpp, repeat.hpp, proto_typeof.hpp, proto_fwd.hpp, proto.hpp, operators.hpp, matches.hpp, make_expr.hpp, literal.hpp, generate.hpp, fusion.hpp, extends.hpp, expr.hpp, eval.hpp, domain.hpp, vararg_matches_impl.hpp:, unpack_expr_.hpp:, traits.hpp:, template_arity_helper.hpp:, vararg_matches_impl.hpp:, unpack_expr_.hpp:, traits.hpp:, template_arity_helper.hpp:, poly_function_traits.hpp:, poly_function_funop.hpp:, or_n.hpp:, memfun_funop.hpp:, matches_.hpp:, make_expr_funop.hpp:, make_expr_.hpp:, make_expr.hpp:, lambda_matches.hpp:, generate_by_value.hpp:, funop.hpp:, extends_funop_const.hpp:, extends_funop.hpp:, expr_variadic.hpp:, expr.hpp:, deep_copy.hpp:, deduce_domain_n.hpp:, classtypeof.hpp:, basic_expr.hpp:, args.hpp:, and_n.hpp:, poly_function_traits.hpp:, poly_function_funop.hpp:, poly_function.hpp, or_n.hpp:, memfun_funop.hpp:, matches_.hpp:, make_expr_funop.hpp:, make_expr_.hpp:, make_expr.hpp:, local.hpp, lambda_matches.hpp:, ignore_unused.hpp, funop.hpp:, extends_funop_const.hpp:, expr_funop.hpp, expr.hpp:, expr.hpp:, dont_care.hpp, deprecated.hpp, deep_copy.hpp:, deduce_domain_n.hpp:, decltype.hpp, classtypeof.hpp:, basic_expr.hpp:, as_lvalue.hpp, args.hpp:, and_n.hpp:, deep_copy.hpp, debug.hpp, core.hpp, context.hpp, null.hpp, default.hpp, callable.hpp, args.hpp, test_symbols.cpp, lambda.hpp:, calc3.cpp, calc2.cpp, as_action.hpp, attr_matcher.hpp, action_matcher.hpp, generate_by_value.hpp: Copyright 2008 Eric Niebler. Distributed under the Boost null_eval.hpp:, default_eval.hpp:, callable_eval.hpp:, null_eval.hpp:, default_eval.hpp:, callable_eval.hpp: Copyright 2008 Frank Mori Hess enable_shared_from_this2.hpp Copyright 2008 Howard Hinnant ratio_test.cpp, common_type.hpp, si_physics.cpp, duration.hpp, xtime.cpp, timeval_demo.cpp, time2_demo_output.txt:, time2_demo.cpp, test_special_values.cpp, test_duration.cpp, test_clock2.cpp, test_clock.cpp, simulated_thread_interface_demo.cpp, saturating.cpp, runtime_resolution.cpp, miscellaneous.cpp, min_time_point.cpp, manipulate_clock_object.cpp, i_dont_like_the_default_duration_behavior.cpp, explore_limits.cpp, cycle_count.cpp, common_type.hpp, ratio_fwd.hpp, ratio.hpp, overflow_helpers.hpp, time_point.hpp, system_clocks.hpp, duration.hpp Copyright 2008 Peter Dimov sp_convertible.hpp Copyright 2009 Eric Niebler. regex_domain.hpp, list.hpp Copyright 2009 Howard Hinnant clock_name.hpp Copyright 2009 Peter Dimov sp_recursive_assign_test.cpp, sp_recursive_assign_rv_test.cpp, sp_recursive_assign2_test.cpp, sp_recursive_assign2_rv_test.cpp, esft_void_test.cpp, esft_second_ptr_test.cpp, auto_ptr_lv_fail.cpp Copyright 2009 Vicente J. Botet Escriba config.hpp, run_timer_test.cpp, xtime.cpp, timeval_demo.cpp, timer.hpp, test_thread_clock.cpp, test_special_values.cpp, test_minmax.cpp, test_duration.cpp, test_clock2.cpp, test_clock.cpp, simulated_thread_interface_demo.cpp, saturating.cpp, runtime_resolution.cpp, miscellaneous.cpp, min_time_point.cpp, manipulate_clock_object.cpp, i_dont_like_the_default_duration_behavior.cpp, explore_limits.cpp, cycle_count.cpp, clock_name.hpp, clock_name.cpp, chrono_accuracy_test.cpp, ratio_fwd.hpp, ratio.hpp, overflow_helpers.hpp Copyright 2009-2010 Vicente J. Botet Escriba static_assert.hpp, duration.hpp, process_cpu_clocks.cpp, system.hpp, static_assert.hpp, signed_unsigned_cmp.hpp, is_evenly_divisible_by.hpp, process_cpu_clocks.hpp, process_cpu_clocks.hpp, chrono.hpp Copyright 2009-2010 Vicente J. Botet Escriba chrono.hpp Copyright 2009-2011 Vicente J. Botet Escriba time_point.hpp, thread_clock.hpp, system_clocks.hpp, process_cpu_clocks.hpp, duration.hpp, config.hpp, chrono.hpp Copyright 2009/2010 Vicente J. Botet Escriba run_timer_example.cpp Copyright 2010 Beman Dawes common_type_test.cpp, common_type_fail.cpp, common_type_2_test.cpp Copyright 2010 Daniel Wallin, Eric Niebler. deduce_domain.hpp Copyright 2010 Eric Niebler. display_expr.cpp, functional.hpp, std.hpp, utility.hpp, fusion.hpp, reverse.hpp, push_front.hpp, push_back.hpp, pop_front.hpp, pop_back.hpp, at.hpp, as_expr.hpp Copyright 2010 Gaetano Mendola, 2011 Simon West. sum_kahan.hpp Copyright 2010 Georg Fritzsche make_shared_fp_test.cpp Copyright 2010 Howard Hinnant display_ex.cpp, rounding.cpp, io_ex5.cpp, io_ex4.cpp, io_ex3.cpp, io_ex2.cpp, io_ex1.cpp, french.cpp Copyright 2010 John Maddock add_lvalue_reference.hpp Copyright 2010 Thomas Heller constrained_ops.cpp Copyright 2010 Vicente J. Botet Escriba add_rvalue_reference_test.cpp, typedefs_pass.cpp, ratio_pass.cpp, ratio4_fail.cpp, ratio3_fail.cpp, ratio2_fail.cpp, ratio1_fail.cpp, ratio_io_pass.cpp, ratio_io_fail.cpp, mpl_times_pass.cpp, mpl_sign_pass.cpp, mpl_plus_pass.cpp, mpl_not_equal_to_pass.cpp, mpl_negate_pass.cpp, mpl_minus_pass.cpp, mpl_less_pass.cpp, mpl_less_equal_pass.cpp, mpl_greater_pass.cpp, mpl_greater_equal_pass.cpp, mpl_equal_to_pass.cpp, mpl_divides_pass.cpp, mpl_abs_pass.cpp, ratio_not_equal_pass.cpp, ratio_less_pass.cpp, ratio_less_equal_pass.cpp, ratio_greater_pass.cpp, ratio_greater_equal_pass.cpp, ratio_equal_pass.cpp, ratio_subtract_pass.cpp, ratio_subtract_fail.cpp, ratio_multiply_pass.cpp, ratio_multiply_fail.cpp, ratio_divide_pass.cpp, ratio_divide_fail.cpp, ratio_add_pass.cpp, ratio_add_fail.cpp, ratio_add_3_fail.cpp, ratio_add_2_fail.cpp, declval.hpp, add_rvalue_reference.hpp, display_ex.cpp, win32_test.cpp, treat_as_floating_point_pass.cpp, duration_values_pass.cpp, common_type_time_point_pass.cpp, common_type_duration_pass.cpp, time_point_cast_pass.cpp, time_point_cast_int_fail.cpp, not_duration_fail.cpp, min_max_pass.cpp, duration.fail.cpp, default_duration_pass.cpp, default_duration.pass.cpp, constructor_pass.cpp, non_implicit_convertible_duration_fail.cpp, implicit_fail.cpp, comparisons_pass.cpp, less_fail.cpp, equal_fail.cpp, arithmetic_pass.cpp, arithmetic_ext_pass.cpp, rep.h:, intmax_c.cpp, types_pass.cpp, typedefs_pass.cpp, ratio_fail.cpp, ratio_alias_pass.cpp, positive_num_fail.cpp, times_rep2_rhs_fail.cpp, times_rep2_lhs_fail.cpp, modulus_rep2_fail.cpp, divide_rep2_fail.cpp, duration_values_pass.cpp, duration_duration_fail.cpp, duration_cast_pass.cpp, duration_cast_int_fail.cpp, default_ratio_pass.cpp, constructor_pass.cpp, treat_as_floating_point_Rep2_true_fail.cpp, non_implicit_convertible_rep_fail.cpp, implicit_constructot_fail.cpp, convert_inexact_fail.cpp, convert_float_to_int_fail.cpp, comparisons_pass.cpp, arithmetic_pass.cpp, clock.h:, errored_clock.hpp, clock_pass.cpp, thread_clock.cpp, io_ex5.cpp, io_ex4.cpp, io_ex3.cpp, io_ex2.cpp, io_ex1.cpp, declval.hpp, add_rvalue_reference.hpp, ratio.hpp, timers.hpp, time.hpp, thread.hpp, system.hpp, synchronization.hpp, security.hpp, process.hpp, memory.hpp, LocalFree.hpp, handles.hpp, GetThreadTimes.hpp, GetProcessTimes.hpp, GetLastError.hpp, GetCurrentThread.hpp, GetCurrentProcess.hpp, file_management.hpp, error_handling.hpp, dll.hpp, directory_management.hpp, basic_types.hpp, scan_keyword.hpp, thread_clock.hpp, thread_clock.hpp Copyright 2011 Eric Niebler switch.cpp, constrained_ops.cpp Copyright 2011 Eric Niebler. external_transforms.cpp, integral_c.hpp, template_arity.hpp Copyright 2011 Simon West. weighted_sum_kahan.hpp Copyright 2011 Vicente J. Botet Escriba ratio_ext_pass.cpp, mpl_rational_constant_pass.cpp, mpl_comparison_pass.cpp, mpl_arithmetic_pass.cpp, time_point_output.cpp, time_point_input.cpp, duration_output.cpp, duration_input.cpp, store_now_in_vector.cpp, rounding.cpp, french.cpp, rational_constant.hpp, comparison.hpp, arithmetic.hpp, include.hpp, round.hpp, floor.hpp, ceil.hpp Copyright Alexander Nasonov, 2006. lexical_cast_loopback_test.cpp, lexical_cast_test.cpp Copyright Alexander Nasonov, 2007. lexical_cast_vc8_bug_test.cpp, lexical_cast_noncopyable_test.cpp Copyright Antony Polukhin, 2011. lexical_cast_wchars_test.cpp, lexical_cast_typedefed_wchar_test_runtime.cpp, lexical_cast_typedefed_wchar_test.cpp, lexical_cast_inf_nan_test.cpp, lexical_cast_float_types_test.cpp, lexical_cast_empty_input_test.cpp, lexical_cast_containers_test.cpp, lexical_cast_test.cpp Copyright Antony Polukhin, 2012. lexical_cast_pointers_test.cpp Copyright Arno Schoedl & Neil Groves 2009. extract_optional_type.hpp Copyright Beman Dawes 2002. minmax_check.cpp Copyright Beman Dawes 1994-2006, 2011 cpu_timer.cpp Copyright Beman Dawes 1994-2007, 2011 timer.hpp Copyright Beman Dawes 1994-99. timer.hpp, progress.hpp Copyright Beman Dawes 1994, 2006, 2008 process_cpu_clocks.hpp, thread_clock.hpp, process_cpu_clocks.hpp, process_cpu_clocks.hpp Copyright Beman Dawes 1995-2001. catch_exceptions.hpp Copyright Beman Dawes 1999. integer_test.cpp Copyright Beman Dawes 2000. cstdint_test.cpp Copyright Beman Dawes 2001. shared_ptr_example2.hpp, scoped_ptr_example.hpp, cstdlib.hpp Copyright Beman Dawes 2002 fstream_test.cpp, deprecated_test.cpp, path_test.cpp, deprecated_test.cpp, fstream.hpp Copyright Beman Dawes 2002-2003. license_check.cpp Copyright Beman Dawes 2002-2005 path.hpp Copyright Beman Dawes 2002-2005, 2009 path.hpp Copyright Beman Dawes 2002-2009 operations.hpp Copyright Beman Dawes 2002-2011. library_status.cpp Copyright Beman Dawes 2002, 2006 error_code.cpp Copyright Beman Dawes 2002, 2008 path_test.cpp Copyright Beman Dawes 2002, 2009. operations_test.cpp Copyright Beman Dawes 2002. compiler_status.cpp, tab_check.cpp, path_name_check.cpp, link_check.cpp, inspect.cpp, end_check.cpp, crlf_check.cpp, Copyright_check.cpp, operations_test.cpp, fstream_test.cpp, fstream.hpp Copyright Beman Dawes 2003 exception.hpp, config.hpp, exception.hpp, config.hpp Copyright Beman Dawes 2003, 2006 config.hpp Copyright Beman Dawes 2003, 2006, 2008 config.hpp, config.hpp Copyright Beman Dawes 2003, 2006, 2010 api_config.hpp Copyright Beman Dawes 2003, 2006, 2011 config.hpp Copyright Beman Dawes 2003. cvs_iterator.hpp Copyright Beman Dawes 2004. large_file_support_test.cpp, large_file_support_test.cpp Copyright Beman Dawes 2005 mbpath.hpp, mbcopy.cpp, wide_test.cpp, lpath.hpp, mbpath.hpp, mbcopy.cpp Copyright Beman Dawes 2005. path_table.cpp, cerrno.hpp Copyright Beman Dawes 2006 auto_cpu_timer_example.cpp, system_error_test.cpp, error_code_user_test.cpp, error_code_test.cpp, system_error.hpp, identifier.hpp, bitmask.hpp Copyright Beman Dawes 2006, 2007 error_code.hpp Copyright Beman Dawes 2006, 2008 run_timer_test.cpp, run_timer_example2.cpp, run_timer_example.cpp, chrono_accuracy_test.cpp Copyright Beman Dawes 2006, 2011 cpu_timer_test.cpp Copyright Beman Dawes 2007 timex.cpp, header_only_test.cpp, windows_error.hpp, linux_error.hpp, cygwin_error.hpp Copyright Beman Dawes 2007, 2011 auto_timers_construction.cpp Copyright Beman Dawes 2008 path.cpp, tchar.cpp, chrono.cpp, timer.hpp, await_keystroke.cpp, cover_operators.hpp, chrono.hpp, chrono.hpp, chrono.hpp, chrono.hpp Copyright Beman Dawes 2008, 2009 path_unit_test.cpp, operations_unit_test.cpp, path_traits.cpp Copyright Beman Dawes 2009 windows_file_codecvt.hpp, windows_file_codecvt.cpp, codecvt_error_category.cpp, tut4.cpp, tut3.cpp, tut2.cpp, tut1.cpp, tut0.cpp, path_info.cpp, error_demo.cpp, path_traits.hpp Copyright Beman Dawes 2009, 2010 test_codecvt.hpp Copyright Beman Dawes 2010 throw_test.cpp, dynamic_link_test.cpp, quoted_manip_test.cpp, windows_attributes.cpp, unique_path.cpp, tut5.cpp, quoted_manip.hpp, filesystem.hpp, path.hpp, operations.hpp, fstream.hpp, exception.hpp, convenience.hpp, config.hpp, lightweight_main.hpp Copyright Beman Dawes 2011 cpu_timer_info.cpp, long_path_test.cpp, locale_info.cpp, stems.cpp, file_status.cpp Copyright Beman Dawes and Daryle Walker 1999. integer.hpp Copyright Beman Dawes, 2002 convenience_test.cpp, convenience_test.cpp Copyright Beman Dawes, 2002-2005 convenience.hpp, convenience.hpp Copyright Beman Dawes, 2004 file_size.cpp, file_size.cpp Copyright Beman Dawes, 2009 scoped_enum_emulation.hpp Copyright Bryce Lelbach 2010 is_sorted.hpp Copyright Bryce Lelbach 2010. no_fenv_h_pass.cpp, no_fenv_h_fail.cpp Copyright Christoper Kohlhoff 2007 initialization_test.cpp, error_code.hpp Copyright Daniel James 2009. end_check.hpp, end_check.cpp Copyright Daniel Walker 2006. concepts.hpp Copyright Darin Adler 2000 cover_operators.hpp Copyright Daryle Walker 2001. integer_test.cpp Copyright David Abrahams 2001. registry.hpp Copyright David Abrahams 2002. false_result.hpp Copyright Dietmar Kuehl 2001 operations.hpp Copyright Douglas Gregor 2001-2003. stateless_test.cpp, function_test.cpp, function_n_test.cpp, allocator_test.cpp, sum_avg.cpp, int_div.cpp, bind1st.cpp, function.hpp Copyright Douglas Gregor 2001-2006 function_template.hpp, function_base.hpp Copyright Douglas Gregor 2002-2003. lambda_test.cpp, function_30.cpp, function9.hpp, function8.hpp, function7.hpp, function6.hpp, function5.hpp, function4.hpp, function3.hpp, function2.hpp, function10.hpp, function1.hpp, function0.hpp, prologue.hpp Copyright Douglas Gregor 2003-2004. result_of_test.cpp Copyright Douglas Gregor 2003. maybe_include.hpp, function_iterate.hpp Copyright Douglas Gregor 2004. bundled_properties.cpp, contains_test.cpp, contains2_test.cpp, result_of.hpp, result_of_iterate.hpp, function_equal.hpp Copyright Douglas Gregor 2008. nothrow_swap.cpp, function_typeof_test.cpp Copyright Emil Dotchevski 2007 function_template.hpp, function_base.hpp Copyright Eric Niebler 2010. Based on the apple_macro_check checker by Marshall Clow assert_macro_check.hpp Copyright Eric Niebler 2010. Based on the assert_macro_check checker by Marshall Clow assert_macro_check.cpp Copyright Gennaro Prota 2006. path_name_check.hpp, path_name_check.cpp, minmax_check.hpp, minmax_check.cpp, inspector.hpp, inspect.cpp Copyright Jan Langer 2002 operations.hpp Copyright Jeff Garland and Beman Dawes, 2002 simple_ls.cpp, simple_ls.cpp Copyright John Maddock 20010. has_gcc_visibility.cpp Copyright John Maddock 2002-4. generate.cpp:, no_wchar_t_pass.cpp, no_wchar_t_fail.cpp, no_void_returns_pass.cpp, no_void_returns_fail.cpp, no_variadic_templates_pass.cpp, no_variadic_templates_fail.cpp, no_variadic_macros_pass.cpp, no_variadic_macros_fail.cpp, no_using_template_pass.cpp, no_using_template_fail.cpp, no_using_decl_overld_pass.cpp, no_using_decl_overld_fail.cpp, no_using_breaks_adl_pass.cpp, no_using_breaks_adl_fail.cpp, no_unified_init_pass.cpp, no_unified_init_fail.cpp, no_unicode_literals_pass.cpp, no_unicode_literals_fail.cpp, no_typename_with_ctor_pass.cpp, no_typename_with_ctor_fail.cpp, no_typeid_pass.cpp, no_typeid_fail.cpp, no_two_phase_lookup_pass.cpp, no_two_phase_lookup_fail.cpp, no_template_template_pass.cpp, no_template_template_fail.cpp, no_template_streams_pass.cpp, no_template_streams_fail.cpp, no_template_aliases_pass.cpp, no_template_aliases_fail.cpp, no_swprintf_pass.cpp, no_swprintf_fail.cpp, no_stdc_namespace_pass.cpp, no_stdc_namespace_fail.cpp, no_std_wstring_pass.cpp, no_std_wstring_fail.cpp, no_std_wstreambuf_pass.cpp, no_std_wstreambuf_fail.cpp, no_std_use_facet_pass.cpp, no_std_use_facet_fail.cpp, no_std_unordered_pass.cpp, no_std_unordered_fail.cpp, no_std_typeinfo_pass.cpp, no_std_typeinfo_fail.cpp, no_std_oi_assign_pass.cpp, no_std_oi_assign_fail.cpp, no_std_min_max_pass.cpp, no_std_min_max_fail.cpp, no_std_messages_pass.cpp, no_std_messages_fail.cpp, no_std_locale_pass.cpp, no_std_locale_fail.cpp, no_std_iterator_pass.cpp, no_std_iterator_fail.cpp, no_std_iter_traits_pass.cpp, no_std_iter_traits_fail.cpp, no_std_distance_pass.cpp, no_std_distance_fail.cpp, no_std_allocator_pass.cpp, no_std_allocator_fail.cpp, no_static_assert_pass.cpp, no_static_assert_fail.cpp, no_sstream_pass.cpp, no_sstream_fail.cpp, no_sfinae_pass.cpp, no_sfinae_fail.cpp, no_sfinae_expr_pass.cpp, no_sfinae_expr_fail.cpp, no_scoped_enums_pass.cpp, no_scoped_enums_fail.cpp, no_rvalue_references_pass.cpp, no_rvalue_references_fail.cpp, no_rtti_pass.cpp, no_rtti_fail.cpp, no_ret_det_pass.cpp, no_ret_det_fail.cpp, no_raw_literals_pass.cpp, no_raw_literals_fail.cpp, no_ptr_mem_const_pass.cpp, no_ptr_mem_const_fail.cpp, no_priv_aggregate_pass.cpp, no_priv_aggregate_fail.cpp, no_partial_spec_pass.cpp, no_partial_spec_fail.cpp, no_part_spec_def_args_pass.cpp, no_part_spec_def_args_fail.cpp, no_ops_in_namespace_pass.cpp, no_ops_in_namespace_fail.cpp, no_nullptr_pass.cpp, no_nullptr_fail.cpp, no_noexcept_pass.cpp, no_noexcept_fail.cpp, no_nested_friendship_pass.cpp, no_nested_friendship_fail.cpp, no_mem_templates_pass.cpp, no_mem_templates_fail.cpp, no_mem_templ_frnds_pass.cpp, no_mem_templ_frnds_fail.cpp, no_mem_tem_pnts_pass.cpp, no_mem_tem_pnts_fail.cpp, no_mem_tem_keyword_pass.cpp, no_mem_tem_keyword_fail.cpp, no_mem_func_spec_pass.cpp, no_mem_func_spec_fail.cpp, no_long_long_pass.cpp, no_long_long_fail.cpp, no_ll_limits_pass.cpp, no_ll_limits_fail.cpp, no_limits_pass.cpp, no_limits_lowest_pass.cpp, no_limits_lowest_fail.cpp, no_limits_fail.cpp, no_limits_const_exp_pass.cpp, no_limits_const_exp_fail.cpp, no_lambdas_pass.cpp, no_lambdas_fail.cpp, no_iter_construct_pass.cpp, no_iter_construct_fail.cpp, no_is_abstract_pass.cpp, no_is_abstract_fail.cpp, no_iostream_pass.cpp, no_iostream_fail.cpp, no_iosfwd_pass.cpp, no_iosfwd_fail.cpp, no_integral_int64_t_pass.cpp, no_integral_int64_t_fail.cpp, no_inline_memb_init_pass.cpp, no_inline_memb_init_fail.cpp, no_initializer_lists_pass.cpp, no_initializer_lists_fail.cpp, no_i64_limits_pass.cpp, no_i64_limits_fail.cpp, no_function_type_spec_pass.cpp, no_function_type_spec_fail.cpp, no_function_template_default_args_pass.cpp, no_function_template_default_args_fail.cpp, no_func_tmp_order_pass.cpp, no_func_tmp_order_fail.cpp, no_fenv_h_pass.cpp, no_fenv_h_fail.cpp, no_extern_template_pass.cpp, no_extern_template_fail.cpp, no_explicit_cvt_ops_pass.cpp, no_explicit_cvt_ops_fail.cpp, no_exp_func_tem_arg_pass.cpp, no_exp_func_tem_arg_fail.cpp, no_exceptions_pass.cpp, no_exceptions_fail.cpp, no_excep_std_pass.cpp, no_excep_std_fail.cpp, no_dep_val_param_pass.cpp, no_dep_val_param_fail.cpp, no_dep_nested_class_pass.cpp, no_dep_nested_class_fail.cpp, no_deleted_functions_pass.cpp, no_deleted_functions_fail.cpp, no_defaulted_functions_pass.cpp, no_defaulted_functions_fail.cpp, no_ded_typename_pass.cpp, no_ded_typename_fail.cpp, no_decltype_pass.cpp, no_decltype_n3276_pass.cpp, no_decltype_n3276_fail.cpp, no_decltype_fail.cpp, no_cwctype_pass.cpp, no_cwctype_fail.cpp, no_cwchar_pass.cpp, no_cwchar_fail.cpp, no_cv_void_spec_pass.cpp, no_cv_void_spec_fail.cpp, no_cv_spec_pass.cpp, no_cv_spec_fail.cpp, no_ctype_functions_pass.cpp, no_ctype_functions_fail.cpp, no_constexpr_pass.cpp, no_constexpr_fail.cpp, no_com_value_init_pass.cpp, no_com_value_init_fail.cpp, no_char32_t_pass.cpp, no_char32_t_fail.cpp, no_char16_t_pass.cpp, no_char16_t_fail.cpp, no_bcb_partial_spec_pass.cpp, no_bcb_partial_spec_fail.cpp, no_auto_ptr_pass.cpp, no_auto_ptr_fail.cpp, no_auto_multidecl_pass.cpp, no_auto_multidecl_fail.cpp, no_auto_declarations_pass.cpp, no_auto_declarations_fail.cpp, no_array_type_spec_pass.cpp, no_array_type_spec_fail.cpp, no_arg_dep_lookup_pass.cpp, no_arg_dep_lookup_fail.cpp, no_adl_barrier_pass.cpp, no_adl_barrier_fail.cpp, no_0x_hdr_unordered_set_pass.cpp, no_0x_hdr_unordered_set_fail.cpp, no_0x_hdr_unordered_map_pass.cpp, no_0x_hdr_unordered_map_fail.cpp, no_0x_hdr_typeindex_pass.cpp, no_0x_hdr_typeindex_fail.cpp, no_0x_hdr_type_traits_pass.cpp, no_0x_hdr_type_traits_fail.cpp, no_0x_hdr_tuple_pass.cpp, no_0x_hdr_tuple_fail.cpp, no_0x_hdr_thread_pass.cpp, no_0x_hdr_thread_fail.cpp, no_0x_hdr_system_error_pass.cpp, no_0x_hdr_system_error_fail.cpp, no_0x_hdr_regex_pass.cpp, no_0x_hdr_regex_fail.cpp, no_0x_hdr_ratio_pass.cpp, no_0x_hdr_ratio_fail.cpp, no_0x_hdr_random_pass.cpp, no_0x_hdr_random_fail.cpp, no_0x_hdr_mutex_pass.cpp, no_0x_hdr_mutex_fail.cpp, no_0x_hdr_initializer_list_pass.cpp, no_0x_hdr_initializer_list_fail.cpp, no_0x_hdr_future_pass.cpp, no_0x_hdr_future_fail.cpp, no_0x_hdr_forward_list_pass.cpp, no_0x_hdr_forward_list_fail.cpp, no_0x_hdr_condition_variable_pass.cpp, no_0x_hdr_condition_variable_fail.cpp, no_0x_hdr_codecvt_pass.cpp, no_0x_hdr_codecvt_fail.cpp, no_0x_hdr_chrono_pass.cpp, no_0x_hdr_chrono_fail.cpp, no_0x_hdr_array_pass.cpp, no_0x_hdr_array_fail.cpp, has_winthreads_pass.cpp, has_winthreads_fail.cpp, has_vc_iterator_pass.cpp, has_vc_iterator_fail.cpp, has_vc6_mem_templ_pass.cpp, has_vc6_mem_templ_fail.cpp, has_variadic_tmpl_pass.cpp, has_variadic_tmpl_fail.cpp, has_unistd_h_pass.cpp, has_unistd_h_fail.cpp, has_tr1_utility_pass.cpp, has_tr1_utility_fail.cpp, has_tr1_unordered_set_pass.cpp, has_tr1_unordered_set_fail.cpp, has_tr1_unordered_map_pass.cpp, has_tr1_unordered_map_fail.cpp, has_tr1_type_traits_pass.cpp, has_tr1_type_traits_fail.cpp, has_tr1_tuple_pass.cpp, has_tr1_tuple_fail.cpp, has_tr1_shared_ptr_pass.cpp, has_tr1_shared_ptr_fail.cpp, has_tr1_result_of_pass.cpp, has_tr1_result_of_fail.cpp, has_tr1_regex_pass.cpp, has_tr1_regex_fail.cpp, has_tr1_ref_wrap_pass.cpp, has_tr1_ref_wrap_fail.cpp, has_tr1_random_pass.cpp, has_tr1_random_fail.cpp, has_tr1_mem_fn_pass.cpp, has_tr1_mem_fn_fail.cpp, has_tr1_hash_pass.cpp, has_tr1_hash_fail.cpp, has_tr1_function_pass.cpp, has_tr1_function_fail.cpp, has_tr1_complex_trig_pass.cpp, has_tr1_complex_trig_fail.cpp, has_tr1_complex_over_pass.cpp, has_tr1_complex_over_fail.cpp, has_tr1_bind_pass.cpp, has_tr1_bind_fail.cpp, has_tr1_array_pass.cpp, has_tr1_array_fail.cpp, has_stlp_use_facet_pass.cpp, has_stlp_use_facet_fail.cpp, has_stdint_h_pass.cpp, has_stdint_h_fail.cpp, has_static_assert_pass.cpp, has_static_assert_fail.cpp, has_slist_pass.cpp, has_slist_fail.cpp, has_sigaction_pass.cpp, has_sigaction_fail.cpp, has_sgi_type_traits_pass.cpp, has_sgi_type_traits_fail.cpp, has_sched_yield_pass.cpp, has_sched_yield_fail.cpp, has_rvalue_refs_pass.cpp, has_rvalue_refs_fail.cpp, has_pthreads_pass.cpp, has_pthreads_fail.cpp, has_pthread_yield_pass.cpp, has_pthread_yield_fail.cpp, has_pthread_ma_st_pass.cpp, has_pthread_ma_st_fail.cpp, has_pthread_delay_np_pass.cpp, has_pthread_delay_np_fail.cpp, has_part_alloc_pass.cpp, has_part_alloc_fail.cpp, has_nrvo_pass.cpp, has_nrvo_fail.cpp, has_nl_types_h_pass.cpp, has_nl_types_h_fail.cpp, has_nanosleep_pass.cpp, has_nanosleep_fail.cpp, has_ms_int64_pass.cpp, has_ms_int64_fail.cpp, has_macro_use_facet_pass.cpp, has_macro_use_facet_fail.cpp, has_long_long_pass.cpp, has_long_long_fail.cpp, has_log1p_pass.cpp, has_log1p_fail.cpp, has_hash_pass.cpp, has_hash_fail.cpp, has_gettimeofday_pass.cpp, has_gettimeofday_fail.cpp, has_getsystemtimeasfiletime_pass.cpp, has_getsystemtimeasfiletime_fail.cpp, has_ftime_pass.cpp, has_ftime_fail.cpp, has_expm1_pass.cpp, has_expm1_fail.cpp, has_dirent_h_pass.cpp, has_dirent_h_fail.cpp, has_clock_gettime_pass.cpp, has_clock_gettime_fail.cpp, has_bethreads_pass.cpp, has_bethreads_fail.cpp, has_2arg_use_facet_pass.cpp, has_2arg_use_facet_fail.cpp, config_test.cpp Copyright John Maddock 2005 tr1_tricky_is_enum_test.cpp, tr1_tricky_add_pointer_test.cpp, tr1_tky_partial_spec_test.cpp, tr1_tky_incomp_type_test.cpp, tr1_tky_function_type_test.cpp, tr1_tky_abstract_type_test.cpp, tr1_remove_volatile_test.cpp, tr1_remove_reference_test.cpp, tr1_remove_pointer_test.cpp, tr1_remove_extent_test.cpp, tr1_remove_cv_test.cpp, tr1_remove_const_test.cpp, tr1_remove_all_extents_test.cpp, tr1_rank_test.cpp, tr1_is_volatile_test.cpp, tr1_is_void_test.cpp, tr1_is_unsigned_test.cpp, tr1_is_union_test.cpp, tr1_is_signed_test.cpp, tr1_is_scalar_test.cpp, tr1_is_same_test.cpp, tr1_is_reference_test.cpp, tr1_is_polymorphic_test.cpp, tr1_is_pointer_test.cpp, tr1_is_pod_test.cpp, tr1_is_object_test.cpp, tr1_is_member_pointer_test.cpp, tr1_is_member_obj_test.cpp, tr1_is_member_func_test.cpp, tr1_is_integral_test.cpp, tr1_is_fundamental_test.cpp, tr1_is_function_test.cpp, tr1_is_floating_point_test.cpp, tr1_is_enum_test.cpp, tr1_is_empty_test.cpp, tr1_is_convertible_test.cpp, tr1_is_const_test.cpp, tr1_is_compound_test.cpp, tr1_is_class_test.cpp, tr1_is_base_of_test.cpp, tr1_is_array_test.cpp, tr1_is_arithmetic_test.cpp, tr1_is_abstract_test.cpp, tr1_has_virtual_destr_test.cpp, tr1_has_trivial_destr_test.cpp, tr1_has_trivial_copy_test.cpp, tr1_has_trivial_constr_test.cpp, tr1_has_trivial_assign_test.cpp, tr1_has_nothrow_copy_test.cpp, tr1_has_nothrow_constr_test.cpp, tr1_has_nothrow_assign_test.cpp, tr1_extent_test.cpp, tr1_alignment_of_test.cpp, tr1_aligned_storage_test.cpp, tr1_add_volatile_test.cpp, tr1_add_reference_test.cpp, tr1_add_pointer_test.cpp, tr1_add_cv_test.cpp, tr1_add_const_test.cpp, tr1_has_tr1_utility_pass.cpp, tr1_has_tr1_utility_fail.cpp, tr1_has_tr1_un_set_pass.cpp, tr1_has_tr1_un_set_fail.cpp, tr1_has_tr1_un_map_pass.cpp, tr1_has_tr1_un_map_fail.cpp, tr1_has_tr1_tuple_pass.cpp, tr1_has_tr1_tuple_fail.cpp, tr1_has_tr1_tt_pass.cpp, tr1_has_tr1_tt_fail.cpp, tr1_has_tr1_shared_ptr_pass.cpp, tr1_has_tr1_shared_ptr_fail.cpp, tr1_has_tr1_result_of_pass.cpp, tr1_has_tr1_result_of_fail.cpp, tr1_has_tr1_regex_pass.cpp, tr1_has_tr1_regex_fail.cpp, tr1_has_tr1_ref_wrap_pass.cpp, tr1_has_tr1_ref_wrap_fail.cpp, tr1_has_tr1_random_pass.cpp, tr1_has_tr1_random_fail.cpp, tr1_has_tr1_mem_fn_pass.cpp, tr1_has_tr1_mem_fn_fail.cpp, tr1_has_tr1_hash_pass.cpp, tr1_has_tr1_hash_fail.cpp, tr1_has_tr1_function_pass.cpp, tr1_has_tr1_function_fail.cpp, tr1_has_tr1_cx_trig_pass.cpp, tr1_has_tr1_cx_trig_fail.cpp, tr1_has_tr1_cx_over_pass.cpp, tr1_has_tr1_cx_over_fail.cpp, tr1_has_tr1_bind_pass.cpp, tr1_has_tr1_bind_fail.cpp, tr1_has_tr1_array_pass.cpp, tr1_has_tr1_array_fail.cpp Copyright John Maddock 2005-2006. precision.hpp, constants.hpp Copyright John Maddock 2005-2008. fpclassify.hpp Copyright John Maddock 2005. log1p_expm1_test.hpp, log1p_expm1_test.cpp Copyright John Maddock 2006 test_remez.cpp Copyright John Maddock 2006-7. gamma.hpp Copyright John Maddock 2006, 2007 test_hermite.cpp, test_ellint_3.cpp, test_ellint_2.cpp, test_ellint_1.cpp, test_bessel_k.cpp Copyright John Maddock 2006, 2007. special_functions.hpp, distributions.hpp, triangular.hpp, normal.hpp Copyright John Maddock 2006, 2010. factorials.hpp Copyright John Maddock 2006. instantiate_all.cpp, igamma_temme_large_coef.cpp, test_minima.cpp, test_instantiate2.cpp, test_instantiate1.cpp, test_factorials.cpp, test_erf.cpp, test_classify.cpp, test_cbrt.cpp, std_real_concept_check.cpp, powm1_sqrtp1m1_test.hpp, tools_toms748_inc_test.cpp, tools_test_inc_test.cpp, tools_test_data_inc_test.cpp, tools_stats_inc_test.cpp, tools_solve_inc_test.cpp, tools_series_inc_test.cpp, tools_roots_inc_test.cpp, tools_remez_inc_test.cpp, tools_real_cast_inc_test.cpp, tools_rational_inc_test.cpp, tools_precision_inc_test.cpp, tools_polynomial_inc_test.cpp, tools_minima_inc_test.cpp, tools_fraction_inc_test.cpp, tools_config_inc_test.cpp, std_real_concept_check.cpp, sf_trunc_incl_test.cpp, sf_sqrt1pm1_incl_test.cpp, sf_sph_harm_incl_test.cpp, sf_sinhc_incl_test.cpp, sf_sinc_incl_test.cpp, sf_sin_pi_incl_test.cpp, sf_sign_incl_test.cpp, sf_round_incl_test.cpp, sf_powm1_incl_test.cpp, sf_next_incl_test.cpp, sf_modf_incl_test.cpp, sf_math_fwd_incl_test.cpp, sf_log1p_incl_test.cpp, sf_legendre_incl_test.cpp, sf_lanczos_incl_test.cpp, sf_laguerre_incl_test.cpp, sf_hypot_incl_test.cpp, sf_hermite_incl_test.cpp, sf_gamma_incl_test.cpp, sf_fpclassify_incl_test.cpp, sf_factorials_incl_test.cpp, sf_expm1_incl_test.cpp, sf_erf_incl_test.cpp, sf_ellint_rj_incl_test.cpp, sf_ellint_rf_incl_test.cpp, sf_ellint_rd_incl_test.cpp, sf_ellint_rc_incl_test.cpp, sf_ellint_3_incl_test.cpp, sf_ellint_2_incl_test.cpp, sf_ellint_1_incl_test.cpp, sf_digamma_incl_test.cpp, sf_cos_pi_incl_test.cpp, sf_cbrt_incl_test.cpp, sf_binomial_incl_test.cpp, sf_beta_incl_test.cpp, sf_bessel_incl_test.cpp, instantiate.hpp, generate.sh:, generate.sh:, generate.sh:, distribution_concept_check.cpp, dist_weibull_incl_test.cpp, dist_uniform_incl_test.cpp, dist_triangular_incl_test.cpp, dist_students_t_incl_test.cpp, dist_poisson_incl_test.cpp, dist_pareto_incl_test.cpp, dist_normal_incl_test.cpp, dist_neg_binom_incl_test.cpp, dist_lognormal_incl_test.cpp, dist_inv_gamma_incl_test.cpp, dist_inv_chi_sq_incl_test.cpp, dist_gamma_incl_test.cpp, dist_fisher_f_incl_test.cpp, dist_find_scale_incl_test.cpp, dist_find_location_incl_test.cpp, dist_extreme_val_incl_test.cpp, dist_exponential_incl_test.cpp, dist_complement_incl_test.cpp, dist_chi_squared_incl_test.cpp, dist_cauchy_incl_test.cpp, dist_binomial_incl_test.cpp, dist_beta_incl_test.cpp, dist_bernoulli_incl_test.cpp, compl_atanh_incl_test.cpp, compl_atan_incl_test.cpp, compl_asinh_incl_test.cpp, compl_asin_incl_test.cpp, compl_acosh_incl_test.cpp, compl_acos_incl_test.cpp, compl_abs_incl_test.cpp, real_cast.hpp, unchecked_factorial.hpp, igamma_large.hpp, ibeta_inverse.hpp, binomial.hpp, weibull.hpp, uniform.hpp, students_t.hpp, lognormal.hpp, gamma.hpp, extreme_value.hpp, exponential.hpp, derived_accessors.hpp, std_real_concept.hpp, real_concept.hpp, distributions.hpp Copyright John Maddock 2007-8. ntl_concept_check.cpp, mpreal_concept_check.cpp, mpfr_concept_check.cpp, real_type_concept.hpp Copyright John Maddock 2007. zeta_data.cpp, process_perf_results.cpp, test_traits.cpp, test_compile_result.hpp, sf_zeta_incl_test.cpp, sf_expint_incl_test.cpp, test_reference.cpp, test_polynomial.cpp, test_igamma.cpp, test_ibeta.cpp, test_gamma.cpp, test_erf.cpp, test_cbrt.cpp, required_defines.hpp, performance_measure.hpp, main.cpp, distributions.cpp, policy_ref_snip9.cpp, policy_ref_snip8.cpp, policy_ref_snip7.cpp, policy_ref_snip6.cpp, policy_ref_snip5.cpp, policy_ref_snip4.cpp, policy_ref_snip3.cpp, policy_ref_snip2.cpp, policy_ref_snip13.cpp, policy_ref_snip12.cpp, policy_ref_snip11.cpp, policy_ref_snip10.cpp, policy_ref_snip1.cpp, policy_eg_9.cpp, policy_eg_8.cpp, policy_eg_7.cpp, policy_eg_6.cpp, policy_eg_5.cpp, policy_eg_4.cpp, policy_eg_3.cpp, policy_eg_2.cpp, policy_eg_10.cpp, policy_eg_1.cpp, traits.hpp, zeta.hpp, trunc.hpp, round.hpp, modf.hpp, expint.hpp, t_distribution_inv.hpp, policy.hpp, error_handling.hpp, pareto.hpp, find_scale.hpp, find_location.hpp, inv_discrete_quantile.hpp, rr.hpp Copyright John Maddock 2008 warning_disable.hpp Copyright John Maddock 2008. inv_hyp_data.cpp, zeta_neg_data.ipp, zeta_data.ipp, zeta_1_up_data.ipp, zeta_1_below_data.ipp, test_laplace.cpp, pch_light.hpp, pch.hpp, nccs.ipp, ncbeta_big.ipp, ncbeta.ipp, expinti_data_long.ipp, expinti_data_double.ipp, expinti_data.ipp, expint_small_data.ipp, expint_data.ipp, expint_1_data.ipp, tr1_incl_test.cpp, dist_nc_t_incl_test.cpp, dist_nc_f_incl_test.cpp, dist_nc_chi_squ_incl_test.cpp, dist_nc_beta_incl_test.cpp, dist_logistic_incl_test.cpp, dist_laplace_incl_test.cpp, dist_hypergeo_incl_test.cpp, truncl.cpp, truncf.cpp, trunc.cpp, tgammal.cpp, tgammaf.cpp, tgamma.cpp, sph_neumannl.cpp, sph_neumannf.cpp, sph_neumann.cpp, sph_legendrel.cpp, sph_legendref.cpp, sph_legendre.cpp, sph_bessell.cpp, sph_besself.cpp, sph_bessel.cpp, roundl.cpp, roundf.cpp, round.cpp, riemann_zetal.cpp, riemann_zetaf.cpp, riemann_zeta.cpp, pch.hpp, nexttowardl.cpp, nexttowardf.cpp, nexttoward.cpp, nextafterl.cpp, nextafterf.cpp, nextafter.cpp, lroundl.cpp, lroundf.cpp, lround.cpp, log1pl.cpp, log1pf.cpp, log1p.cpp, llroundl.cpp, llroundf.cpp, llround.cpp, lgammal.cpp, lgammaf.cpp, lgamma.cpp, legendrel.cpp, legendref.cpp, legendre.cpp, laguerrel.cpp, laguerref.cpp, laguerre.cpp, hypotl.cpp, hypotf.cpp, hypot.cpp, hermitel.cpp, hermitef.cpp, hermite.cpp, fpclassifyl.cpp, fpclassifyf.cpp, fpclassify.cpp, fminl.cpp, fminf.cpp, fmin.cpp, fmaxl.cpp, fmaxf.cpp, fmax.cpp, expm1l.cpp, expm1f.cpp, expm1.cpp, expintl.cpp, expintf.cpp, expint.cpp, erfl.cpp, erff.cpp, erfcl.cpp, erfcf.cpp, erfc.cpp, erf.cpp, ellint_3l.cpp, ellint_3f.cpp, ellint_3.cpp, ellint_2l.cpp, ellint_2f.cpp, ellint_2.cpp, ellint_1l.cpp, ellint_1f.cpp, ellint_1.cpp, cyl_neumannl.cpp, cyl_neumannf.cpp, cyl_neumann.cpp, cyl_bessel_kl.cpp, cyl_bessel_kf.cpp, cyl_bessel_k.cpp, cyl_bessel_jl.cpp, cyl_bessel_jf.cpp, cyl_bessel_j.cpp, cyl_bessel_il.cpp, cyl_bessel_if.cpp, cyl_bessel_i.cpp, copysignl.cpp, copysignf.cpp, copysign.cpp, comp_ellint_3l.cpp, comp_ellint_3f.cpp, comp_ellint_3.cpp, comp_ellint_2l.cpp, comp_ellint_2f.cpp, comp_ellint_2.cpp, comp_ellint_1l.cpp, comp_ellint_1f.cpp, comp_ellint_1.cpp, cbrtl.cpp, cbrtf.cpp, cbrt.cpp, c_policy.hpp, betal.cpp, betaf.cpp, beta.cpp, atanhl.cpp, atanhf.cpp, atanh.cpp, assoc_legendrel.cpp, assoc_legendref.cpp, assoc_legendre.cpp, assoc_laguerrel.cpp, assoc_laguerref.cpp, assoc_laguerre.cpp, asinhl.cpp, asinhf.cpp, asinh.cpp, acoshl.cpp, acoshf.cpp, acosh.cpp, dist_graphs.cpp, has_ntl_rr.cpp, has_mpreal.cpp, has_mpfr_class.cpp, has_long_double_support.cpp, has_gmpxx.cpp, laplace.hpp, generic_quantile.hpp, mpreal.hpp, mpfr.hpp, e_float.hpp Copyright John Maddock 2009. main.cpp, test_expm1_log1p.cpp, test_beta.cpp, test_bessel.cpp, integer_test.cpp Copyright John Maddock 2010. test_math_fwd.cpp, inverse_gaussian.hpp, inverse_gamma.hpp Copyright John Maddock 2011. e_float_concept_check.cpp, has_e_float.cpp Copyright Jonathan Turkanis 2005. remove_extent.hpp Copyright Marshall Clow 2007. Based on the tab-check checker by Beman Dawes ascii_check.hpp, ascii_check.cpp, apple_macro_check.hpp, apple_macro_check.cpp Copyright Neil Groves & Thorsten Ottosen & Pavol Droba 2003-2004. iterator_range_core.hpp Copyright Neil Groves 2007. algorithm_ext.hpp, adaptors.hpp, strided.hpp, replaced_if.hpp, replaced.hpp Copyright Neil Groves 2009. misc_concept.hpp, concepts.hpp, multiply_by_x.hpp, greater_than_x.hpp, false_predicate.hpp, equal_to_x.hpp, counted_function.hpp, check_equal_fn.hpp, range_return_test_driver.hpp, counting_range.cpp, upper_bound.cpp, unique_copy.cpp, unique.cpp, transform.cpp, swap_ranges.cpp, stable_sort.cpp, stable_partition.cpp, sort.cpp, set_union.cpp, set_symmetric_difference.cpp, set_intersection.cpp, set_difference.cpp, search_n.cpp, search.cpp, rotate_copy.cpp, rotate.cpp, reverse_copy.cpp, reverse.cpp, replace_if.cpp, replace_copy_if.cpp, replace_copy.cpp, replace.cpp, remove_if.cpp, remove_copy_if.cpp, remove_copy.cpp, remove.cpp, random_shuffle.cpp, prev_permutation.cpp, partition.cpp, partial_sort.cpp, nth_element.cpp, next_permutation.cpp, mismatch.cpp, min_element.cpp, merge.cpp, max_element.cpp, lower_bound.cpp, lexicographical_compare.cpp, inplace_merge.cpp, heap.cpp, generate.cpp, for_each.cpp, find_if.cpp, find_first_of.cpp, find_end.cpp, find.cpp, fill.cpp, equal_range.cpp, equal.cpp, count_if.cpp, count.cpp, copy_n.cpp, copy_backward.cpp, copy.cpp, binary_search.cpp, adjacent_find.cpp, uniqued_example.cpp, uniqued.cpp, transformed_example.cpp, transformed.cpp, tokenized.cpp, strided_example.cpp, strided.cpp, sliced_example.cpp, sliced.cpp, reversed_example.cpp, reversed.cpp, replaced_if_example.cpp, replaced_if.cpp, replaced_example.cpp, replaced.cpp, map_values_example.cpp, map_keys_example.cpp, map.cpp, indirected_example.cpp, indirected.cpp, indexed_example.cpp, indexed.cpp, filtered_example.cpp, filtered.cpp, copied_example.cpp, copied.cpp, adjacent_filtered_example.cpp, adjacent_filtered.cpp, sub_range.hpp, join.hpp, iterator_range_io.hpp, iterator_range.hpp, range_return.hpp, join_iterator.hpp, demote_iterator_traversal_tag.hpp, push_front.hpp, push_back.hpp, overwrite.hpp, is_sorted.hpp, iota.hpp, insert.hpp, for_each.hpp, erase.hpp, copy_n.hpp, upper_bound.hpp, unique_copy.hpp, unique.hpp, transform.hpp, swap_ranges.hpp, stable_sort.hpp, stable_partition.hpp, sort.hpp, set_algorithm.hpp, search_n.hpp, search.hpp, rotate_copy.hpp, rotate.hpp, reverse_copy.hpp, reverse.hpp, replace_if.hpp, replace_copy_if.hpp, replace_copy.hpp, replace.hpp, remove_if.hpp, remove_copy_if.hpp, remove_copy.hpp, remove.hpp, random_shuffle.hpp, permutation.hpp, partition.hpp, partial_sort_copy.hpp, partial_sort.hpp, nth_element.hpp, mismatch.hpp, min_element.hpp, merge.hpp, max_element.hpp, lower_bound.hpp, lexicographical_compare.hpp, inplace_merge.hpp, heap_algorithm.hpp, generate.hpp, for_each.hpp, find_if.hpp, find_first_of.hpp, find_end.hpp, find.hpp, fill_n.hpp, fill.hpp, equal_range.hpp, equal.hpp, count_if.hpp, count.hpp, copy_backward.hpp, copy.hpp, binary_search.hpp, adjacent_find.hpp Copyright Neil Groves 2010. true_predicate.hpp, pointer_as_iterator.cpp, join.cpp, istream_range.cpp, irange.cpp, has_range_iterator.cpp, end.cpp, begin.cpp, push_front.cpp, push_back.cpp, overwrite.cpp, is_sorted.cpp, iota.cpp, insert.cpp, for_each_ext.cpp, erase.cpp, copy_n.cpp, type_erased_example.cpp, type_erased.cpp, strided2.cpp, istream_range.hpp, irange.hpp, has_range_iterator.hpp, any_iterator_wrapper.hpp, any_iterator_interface.hpp, any_iterator_buffer.hpp, any_iterator.hpp, counting_range.hpp, combine.hpp, any_range.hpp, type_erased.hpp, define_adaptor.hpp Copyright Neil Groves 2011. ticket_5556_is_sorted_namespace.cpp, ticket_5547.cpp, ticket_5544_terminate_irange.cpp, ticket_5486.cpp Copyright Paul A. Bristow 2006-2010. constants.hpp Copyright Paul A. Bristow 2006, 2007, 2009, 2010. distributions.hpp Copyright Paul A. Bristow 2006, 2007. special_functions.hpp, triangular.hpp, normal.hpp Copyright Paul A. Bristow 2006. uniform.hpp, students_t.hpp Copyright Paul A. Bristow 2007 test_remez.cpp, test_hermite.cpp, test_erf.cpp, test_ellint_3.cpp, test_ellint_2.cpp, test_ellint_1.cpp, test_classify.cpp, test_bessel_k.cpp, t_distribution_inv.hpp, ibeta_inverse.hpp Copyright Paul A. Bristow 2007, 2009 pareto.hpp Copyright Paul A. Bristow 2007, 2010. instantiate.hpp, policy_eg_3.cpp Copyright Paul A. Bristow 2007. test_minima.cpp, gamma.hpp, error_handling.hpp, rayleigh.hpp, find_scale.hpp, find_location.hpp Copyright Paul A. Bristow 2008, 2009 dist_graphs.cpp Copyright Paul A. Bristow 2008, 2009. test_laplace.cpp Copyright Paul A. Bristow 2008. laplace.hpp Copyright Paul A. bristow 2009 ntl_concept_check.cpp Copyright Paul A. Bristow 2010 test_cbrt.cpp, log1p_expm1_test.hpp, log1p_expm1_test.cpp, policy_ref_snip9.cpp, policy_ref_snip3.cpp, policy_ref_snip2.cpp, policy_ref_snip13.cpp, policy_ref_snip12.cpp, policy_ref_snip11.cpp, policy_ref_snip10.cpp, policy_eg_9.cpp, policy_eg_8.cpp, policy_eg_7.cpp, policy_eg_6.cpp, policy_eg_5.cpp, policy_eg_4.cpp, policy_eg_2.cpp, policy_eg_10.cpp Copyright Paul A. Bristow 2010. test_math_fwd.cpp, policy_ref_snip8.cpp, policy_ref_snip7.cpp, policy_ref_snip6.cpp, policy_ref_snip5.cpp, policy_ref_snip4.cpp, policy_ref_snip1.cpp, inverse_gaussian.hpp, inverse_gamma.hpp Copyright Paul A. Britow 2009 has_mpreal.cpp, has_mpfr_class.cpp Copyright Paul A> Bristow 2010 policy_eg_1.cpp Copyright Pavol Droba 2002-2003. (C) Copyright Thorsten Ottosen 2002-2003. collection_traits.hpp Copyright Pavol Droba 2002-2003. slist_traits.hpp, trim_test.cpp, split_test.cpp, replace_test.cpp, regex_test.cpp, predicate_test.cpp, join_test.cpp, find_test.cpp, conv_test.cpp, trim_example.cpp, split_example.cpp, rle_example.cpp, replace_example.cpp, regex_example.cpp, predicate_example.cpp, find_example.cpp, conv_example.cpp, collection_traits_detail.hpp, yes_no_type.hpp, trim_all.hpp, trim.hpp, std_containers_traits.hpp, string_traits.hpp, rope_traits.hpp, list_traits.hpp, sequence_traits.hpp, regex_find_format.hpp, regex.hpp, predicate_facade.hpp, predicate.hpp, iter_find.hpp, formatter.hpp, find_format.hpp, find.hpp, util.hpp, trim.hpp, sequence.hpp, replace_storage.hpp, predicate.hpp, formatter_regex.hpp, formatter.hpp, finder_regex.hpp, find_iterator.hpp, find_format_store.hpp, find_format_all.hpp, find_format.hpp, classification.hpp, case_conv.hpp, constants.hpp, config.hpp, concept.hpp, classification.hpp, case_conv.hpp Copyright Pavol Droba 2002-2004. string_regex.hpp, string.hpp, find_iterator.hpp Copyright Pavol Droba 2002-2006. split.hpp, replace.hpp, join.hpp, finder.hpp, erase.hpp, finder.hpp, compare.hpp Copyright Pierre Esterie & Joel Falcou. switch.cpp Copyright Rene Rivera 2004. minmax_check.hpp Copyright Rene Rivera 2004-2006. inspect.cpp Copyright Rene Rivera 2004. Contributed by Joerg Walter crlf_check.hpp Copyright Rene Rivera 2004. link_check.hpp, license_check.hpp, inspector.hpp, end_check.hpp, Copyright_check.hpp Copyright Samuel Krempp 2003 format.hpp, internals_fwd.hpp, internals.hpp, group.hpp, free_funcs.hpp, format_implementation.hpp, format_fwd.hpp, format_class.hpp, feed_args.hpp, workarounds_gcc-2_95.hpp, unset_macros.hpp, alt_sstream_impl.hpp, alt_sstream.hpp Copyright Samuel Krempp 2003. format_test_wstring.cpp, format_test3.cpp, format_test2.cpp, format_test1.cpp, sample_userType.cpp, sample_new_features.cpp, sample_formats.cpp, parsing.hpp, workarounds_stlport.hpp, msvc_disambiguater.hpp, config_macros.hpp, compat_workarounds.hpp, exceptions.hpp Copyright Sergey Shandar 2005, Alexander Nasonov, 2007. lexical_cast_abstract_test.cpp Copyright Steven Watanabe 2009. format_test_enum.cpp Copyright Terje Sletteb and Kevlin Henney, 2005. lexical_cast_test.cpp Copyright Thijs van den Berg, 2008. test_laplace.cpp, laplace.hpp Copyright Thorsten Ottosen & Larry Evans 2003-2005. iterator_range.cpp Copyright Thorsten Ottosen 2003-2004. tuple_list_of.cpp, std.cpp, static_list_of.cpp, ptr_map_inserter.cpp, ptr_list_of.cpp, my_vector_example.cpp, multi_index_container.cpp, list_of_workaround.cpp, list_of.cpp, list_inserter.cpp, email_example.cpp, basic.cpp, array.cpp, my_vector_example.html:, multi_index_container.html:, assign.hpp, std.hpp, vector.hpp, stack.hpp, slist.hpp, set.hpp, queue.hpp, map.hpp, list.hpp, deque.hpp, list_of.hpp, list_inserter.hpp, assignment_exception.hpp, sub_range.cpp, string.cpp, std_container.cpp, reversible_range.cpp, partial_workaround.cpp, iterator_pair.cpp, extension_size.cpp, extension_mechanism.cpp, const_ranges.cpp, compat3.cpp, compat2.cpp, array.cpp, algorithm_example.cpp, adl_conformance_no_using.cpp, adl_conformance.cpp, uniqued.cpp, transformed.cpp, tokenized.cpp, strided.cpp, sliced.cpp, reversed.cpp, replaced_if.cpp, replaced.cpp, map_values.cpp, map_keys.cpp, indirected.cpp, indexed.cpp, filtered.cpp, copied.cpp, adjacent_filtered.cpp, email_example.html:, range.hpp, value_type.hpp, sub_range.hpp, size_type.hpp, size.hpp, reverse_result_iterator.hpp, reverse_iterator.hpp, result_iterator.hpp, rend.hpp, reference.hpp, rbegin.hpp, mutable_iterator.hpp, metafunctions.hpp, iterator.hpp, end.hpp, empty.hpp, difference_type.hpp, size.hpp, end.hpp, value_type.hpp, sizer.hpp, size_type.hpp, size.hpp, sfinae.hpp, iterator.hpp, implementation_help.hpp, end.hpp, empty.hpp, difference_type.hpp, detail_str.hpp, const_iterator.hpp, common.hpp, begin.hpp, const_reverse_iterator.hpp, const_iterator.hpp, config.hpp, begin.hpp Copyright Thorsten Ottosen 2003-2005. tutorial_example.html:, todo.txt:, ptr_container.xml:, Jamfile.v2:, intro.xml:, examples.html:, comp_tutorial.sh:, comp_rever_ptr_container.sh:, comp_reference.sh:, comp_ptr_vector.sh:, comp_ptr_set_adapter.sh:, comp_ptr_set.sh:, comp_ptr_sequence_adapter.sh:, comp_ptr_multiset_adapter.sh:, comp_ptr_multiset.sh:, comp_ptr_multimap_adapter.sh:, comp_ptr_multimap.sh:, comp_ptr_map_adapter.sh:, comp_ptr_map.sh:, comp_ptr_list.sh:, comp_ptr_inserter.sh:, comp_ptr_deque.sh:, comp_ptr_container.sh:, comp_ptr_array.sh:, comp_indirect_fun.sh:, comp_headers.sh:, comp_guidelines.sh:, comp_faq.sh:, comp_examples.sh:, comp_conventions.sh:, comp_assoc_ptr_container.sh:, comp_all.sh:, comp.sh:, style.css:, ptr_list_of.hpp, ptr_list_inserter.hpp, view_example.cpp, tut34.cpp, tut1.cpp, tree_test.cpp, test_data.hpp, simple_test.cpp, serialization.cpp, sequence_test_data.hpp, ptr_vector_size.cpp, ptr_vector.cpp, ptr_unordered_set.cpp, ptr_set.cpp, ptr_map_adapter.cpp, ptr_map.cpp, ptr_list.cpp, ptr_deque.cpp, ptr_container_adapter.cpp, ptr_circular_buffer.cpp, ptr_array.cpp, pointainer_speed.cpp, iterator_test.cpp, indirect_fun.cpp, incomplete_type_test.cpp, associative_test_data.hpp, ptr_vector.hpp, ptr_set_adapter.hpp, ptr_set.hpp, ptr_sequence_adapter.hpp, ptr_map_adapter.hpp, ptr_map.hpp, ptr_list.hpp, ptr_deque.hpp, ptr_array.hpp, nullable.hpp, exception.hpp, void_ptr_iterator.hpp, scoped_deleter.hpp, reversible_ptr_container.hpp, map_iterator.hpp, associative_ptr_container.hpp, clone_allocator.hpp Copyright Thorsten Ottosen 2003-2006. ptr_list_inserter.cpp, pointer.hpp, functions.hpp, distance.hpp, category.hpp Copyright Thorsten Ottosen 2003-2007. indirect_fun.hpp, serialize_xml_names.hpp Copyright Thorsten Ottosen 2003-2008. Jamfile.v2:, Jamfile.v2:, example.cpp, ptr_container.hpp Copyright Thorsten Ottosen 2006. ptr_map_inserter.hpp, combine.cpp, algorithm.cpp, adaptors.cpp, no_exceptions.cpp, str_types.hpp, as_literal.hpp, as_literal.hpp, as_array.hpp, algorithm_ext.hpp, adaptors.hpp, throw_exception.hpp Copyright Thorsten Ottosen 2008. ptr_unordered_map.cpp, ptr_inserter.cpp, serialize_ptr_unordered_set.hpp, serialize_ptr_unordered_map.hpp, serialize_ptr_circular_buffer.hpp, ptr_unordered_set.hpp, ptr_unordered_map.hpp, ptr_inserter.hpp, ptr_circular_buffer.hpp, meta_functions.hpp Copyright Thorsten Ottosen, Neil Groves 2006 - 2008. uniqued.hpp, transformed.hpp, sliced.hpp, reversed.hpp, map.hpp, indirected.hpp, indexed.hpp, filtered.hpp, copied.hpp, argument_fwd.hpp, adjacent_filtered.hpp Copyright Thorsten Ottosen, Neil Groves 2006. tokenized.hpp Copyright Vicente J. Botet Escriba 2009 chrono.hpp, process_cpu_clocks.hpp, process_cpu_clocks.hpp, chrono.hpp Copyright Vicente J. Botet Escriba 2009-2010 chrono.cpp Copyright Vicente J. Botet Escriba 2009-2011 thread_clock.hpp Copyright Vicente J. Botet Escriba 2010 thread_clock.hpp Copyright Vladimir Prus 2002 path_test.cpp, deprecated_test.cpp, path_test.cpp, deprecated_test.cpp, path.hpp, operations.hpp, path.hpp Copyright Vladimir Prus, 2002 convenience_test.cpp, convenience_test.cpp, convenience.hpp, convenience.hpp Copyright Xiaogang Zhang 2006 test_ellint_3.cpp, test_ellint_2.cpp, test_ellint_1.cpp ----------------------------------------------------------------------------------------------------------- Lua http://www.lua.org/ Copied from: http://www.lua.org/license.html Copyright © 1994-2012 Lua.org, PUC-Rio. 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 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.