././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.401256 maxminddb-1.5.2/0000755000175000017500000000000000000000000013355 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867374.0 maxminddb-1.5.2/HISTORY.rst0000644000175000017500000001416300000000000015255 0ustar00greggreg00000000000000.. :changelog: History ------- 1.5.2 (2019-12-20) ++++++++++++++++++ * Minor performance improvements in the pure Python reader. 1.5.1 (2019-09-27) ++++++++++++++++++ * Fix a possible segfault due to not correctly incrementing the reference on a returned object. 1.5.0 (2019-09-27) ++++++++++++++++++ * Python 3.3 and 3.4 are no longer supported. * The extension source directory was moved to prevent an ``ImportWarning`` when importing the module on Python 2 with ``-Wdefault`` set. Reported by David Szotten and Craig de Stigter. GitHub #31. * The ``get`` method now accepts ``ipaddress.IPv4Address`` and ``ipaddress.IPv6Address`` objects in addition to strings. This works with both the pure Python implementation as well as the extension. Based on a pull request #48 by Eric Pruitt. GitHub #50. * A new method, ``get_with_prefix_len``, was added. This method returns a tuple containing the record and the prefix length. 1.4.1 (2018-06-22) ++++++++++++++++++ * Fix test failure on Python 3.7. Reported by Carl George. GitHub #35. 1.4.0 (2018-05-25) ++++++++++++++++++ * IMPORTANT: Previously, the pure Python reader would allow ``ipaddress.IPv4Address`` and ``ipaddress.IPv6Address`` objects when calling ``.get()``. This would fail with the C extension. The fact that these objects worked at all was an implementation detail and has varied with different releases. This release makes the pure Python implementation consistent with the extension. A ``TypeError`` will now be thrown if you attempt to use these types with either the pure Python implementation or the extension. The IP address passed to ``.get()`` should be a string type. * Fix issue where incorrect size was used when unpacking some types with the pure Python reader. Reported by Lee Symes. GitHub #30. * You may now pass in the database via a file descriptor rather than a file name when creating a new ``maxminddb.Reader`` object using ``MODE_FD``. This will read the database from the file descriptor into memory. Pull request by nkinkade. GitHub #33. 1.3.0 (2017-03-13) ++++++++++++++++++ * ``maxminddb.Reader`` and the C extension now support being used in a context manager. Pull request by Joakim Uddholm. GitHub #21 & #28. * Provide a more useful error message when ``MODE_MMAP_EXT`` is requested but the C extension is not available. 1.2.3 (2017-01-11) ++++++++++++++++++ * Improve compatibility with other Python 2 ``ipaddress`` backports. Although ``ipaddress`` is highly recommended, ``py2-ipaddress`` and ``backport_ipaddress`` should now work. Incompatibility reported by John Zadroga on ``geoip2`` GitHub issue #41. 1.2.2 (2016-11-21) ++++++++++++++++++ * Fix to the classifiers in ``setup.py``. No code changes. 1.2.1 (2016-06-10) ++++++++++++++++++ * This module now uses the ``ipaddress`` module for Python 2 rather than the ``ipaddr`` module. Users should notice no behavior change beyond the change in dependencies. * Removed ``requirements.txt`` from ``MANIFEST.in`` in order to stop warning during installation. * Added missing test data. 1.2.0 (2015-04-07) ++++++++++++++++++ * Previously if ``MODE_FILE`` was used and the database was loaded before forking, the parent and children would use the same file table entry without locking causing errors reading the database due to the offset being changed by other processes. In ``MODE_FILE``, the reader will now use ``os.pread`` when available and a lock when ``os.pread`` is not available (e.g., Python 2). If you are using ``MODE_FILE`` on a Python without ``os.pread``, it is recommended that you open the database after forking to reduce resource contention. * The ``Metadata`` class now overloads ``__repr__`` to provide a useful representation of the contents when debugging. * An ``InvalidDatabaseError`` will now be thrown if the data type read from the database is invalid. Previously a ``KeyError`` was thrown. 1.1.1 (2014-12-10) ++++++++++++++++++ * On Python 3 there was a potential issue where ``open_database`` with ``MODE_AUTO`` would try to use the C extension when it was not available. This could cause the function to fail rather than falling back to a pure Python mode. 1.1.0 (2014-12-09) ++++++++++++++++++ * The pure Python reader now supports an optional file and memory mode in addition to the existing memory-map mode. If your Python does not provide the ``mmap`` module, the file mode will be used by default. * The preferred method for opening a database is now the ``open_database`` function in ``maxminddb``. This function now takes an optional read ``mode``. * The C extension no longer creates its own ``InvalidDatabaseError`` class and instead uses the one defined in ``maxminddb.errors``. 1.0.0 (2014-09-22) ++++++++++++++++++ * First production release. * Two potential C extension issues discovered by Coverity were fixed: - There was a small resource leak that occurred when the system ran out of memory. - There was a theoretical null pointer issue that would occur only if libmaxminddb returned invalid data. 0.3.3 (2014-04-09) ++++++++++++++++++ * Corrected initialization of objects in C extension and made the objects behave more similarly to their pure Python counterparts. 0.3.2 (2014-03-28) ++++++++++++++++++ * Switched to Apache 2.0 license. * We now open the database file in read-only mode. * Minor code clean-up. 0.3.1 (2014-02-11) ++++++++++++++++++ * Fixed packaging problem that caused ``import`` to fail. 0.3.0 (2014-02-11) ++++++++++++++++++ * This release includes a pure Python implementation of the database reader. If ``libmaxminddb`` is not available or there are compilation issues, the module will fall-back to the pure Python implementation. * Minor changes were made to the exceptions of the C extension make them consistent with the pure Python implementation. 0.2.1 (2013-12-18) ++++++++++++++++++ * Removed -Werror compiler flag as it was causing problems for some OS X users. 0.2.0 (2013-10-15) ++++++++++++++++++ * Refactored code and fixed a memory leak when throwing an exception. 0.1.1 (2013-10-03) ++++++++++++++++++ * Added MANIFEST.in 0.1.0 (2013-10-02) ++++++++++++++++++ * Initial release ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1547072470.0 maxminddb-1.5.2/LICENSE0000644000175000017500000002613600000000000014372 0ustar00greggreg00000000000000 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1547072470.0 maxminddb-1.5.2/MANIFEST.in0000644000175000017500000000017100000000000015112 0ustar00greggreg00000000000000include HISTORY.rst README.rst LICENSE tests/*.py tests/data/test-data/*.mmdb tests/data/test-data/*.raw graft docs/html ././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.401256 maxminddb-1.5.2/PKG-INFO0000644000175000017500000001304100000000000014451 0ustar00greggreg00000000000000Metadata-Version: 1.2 Name: maxminddb Version: 1.5.2 Summary: Reader for the MaxMind DB format Home-page: http://www.maxmind.com/ Author: Gregory Oschwald Author-email: goschwald@maxmind.com License: Apache License, Version 2.0 Description: ======================== MaxMind DB Python Module ======================== Description ----------- This is a Python module for reading MaxMind DB files. The module includes both a pure Python reader and an optional C extension. MaxMind DB is a binary file format that stores data indexed by IP address subnets (IPv4 or IPv6). Installation ------------ If you want to use the C extension, you must first install `libmaxminddb `_ C library installed before installing this extension. If the library is not available, the module will fall-back to a pure Python implementation. To install maxminddb, type: .. code-block:: bash $ pip install maxminddb If you are not able to use pip, you may also use easy_install from the source directory: .. code-block:: bash $ easy_install . Usage ----- To use this module, you must first download or create a MaxMind DB file. We provide `free GeoLite2 databases `_. These files must be decompressed with ``gunzip``. After you have obtained a database and imported the module, call ``open_database`` with a path, or file descriptor (in the case of MODE_FD), to the database as the first argument. Optionally, you may pass a mode as the second argument. The modes are exported from ``maxminddb``. Valid modes are: * MODE_MMAP_EXT - use the C extension with memory map. * MODE_MMAP - read from memory map. Pure Python. * MODE_FILE - read database as standard file. Pure Python. * MODE_MEMORY - load database into memory. Pure Python. * MODE_FD - load database into memory from a file descriptor. Pure Python. * MODE_AUTO - try MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that order. Default. **NOTE**: When using ``MODE_FD``, it is the *caller's* responsibility to be sure that the file descriptor gets closed properly. The caller may close the file descriptor immediately after the ``Reader`` object is created. The ``open_database`` function returns a ``Reader`` object. To look up an IP address, use the ``get`` method on this object. The method will return the corresponding values for the IP address from the database (e.g., a dictionary for GeoIP2/GeoLite2 databases). If the database does not contain a record for that IP address, the method will return ``None``. If you wish to also retrieve the prefix length for the record, use the ``get_with_prefix_len`` method. This returns a tuple containing the record followed by the network prefix length associated with the record. Example ------- .. code-block:: pycon >>> import maxminddb >>> >>> reader = maxminddb.open_database('GeoLite2-City.mmdb') >>> >>> reader.get('1.1.1.1') {'country': ... } >>> >>> reader.get_with_prefix_len('1.1.1.1') ({'country': ... }, 24) >>> >>> reader.close() Exceptions ---------- The module will return an ``InvalidDatabaseError`` if the database is corrupt or otherwise invalid. A ``ValueError`` will be thrown if you look up an invalid IP address or an IPv6 address in an IPv4 database. Requirements ------------ This code requires Python 2.7+ or 3.5+. Older versions are not supported. The C extension requires CPython. The pure Python implementation has been tested with PyPy. On Python 2, the `ipaddress module `_ is required. Versioning ---------- The MaxMind DB Python module uses `Semantic Versioning `_. Support ------- Please report all issues with this code using the `GitHub issue tracker `_ If you are having an issue with a MaxMind service that is not specific to this API, please contact `MaxMind support `_ for assistance. Platform: UNKNOWN Classifier: Development Status :: 5 - Production/Stable Classifier: Environment :: Web Environment Classifier: Intended Audience :: Developers Classifier: Intended Audience :: System Administrators Classifier: License :: OSI Approved :: Apache Software License Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.5 Classifier: Programming Language :: Python :: 3.6 Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python Classifier: Topic :: Internet :: Proxy Servers Classifier: Topic :: Internet Requires-Python: >=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.* ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1569616738.0 maxminddb-1.5.2/README.rst0000644000175000017500000000730400000000000015050 0ustar00greggreg00000000000000======================== MaxMind DB Python Module ======================== Description ----------- This is a Python module for reading MaxMind DB files. The module includes both a pure Python reader and an optional C extension. MaxMind DB is a binary file format that stores data indexed by IP address subnets (IPv4 or IPv6). Installation ------------ If you want to use the C extension, you must first install `libmaxminddb `_ C library installed before installing this extension. If the library is not available, the module will fall-back to a pure Python implementation. To install maxminddb, type: .. code-block:: bash $ pip install maxminddb If you are not able to use pip, you may also use easy_install from the source directory: .. code-block:: bash $ easy_install . Usage ----- To use this module, you must first download or create a MaxMind DB file. We provide `free GeoLite2 databases `_. These files must be decompressed with ``gunzip``. After you have obtained a database and imported the module, call ``open_database`` with a path, or file descriptor (in the case of MODE_FD), to the database as the first argument. Optionally, you may pass a mode as the second argument. The modes are exported from ``maxminddb``. Valid modes are: * MODE_MMAP_EXT - use the C extension with memory map. * MODE_MMAP - read from memory map. Pure Python. * MODE_FILE - read database as standard file. Pure Python. * MODE_MEMORY - load database into memory. Pure Python. * MODE_FD - load database into memory from a file descriptor. Pure Python. * MODE_AUTO - try MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that order. Default. **NOTE**: When using ``MODE_FD``, it is the *caller's* responsibility to be sure that the file descriptor gets closed properly. The caller may close the file descriptor immediately after the ``Reader`` object is created. The ``open_database`` function returns a ``Reader`` object. To look up an IP address, use the ``get`` method on this object. The method will return the corresponding values for the IP address from the database (e.g., a dictionary for GeoIP2/GeoLite2 databases). If the database does not contain a record for that IP address, the method will return ``None``. If you wish to also retrieve the prefix length for the record, use the ``get_with_prefix_len`` method. This returns a tuple containing the record followed by the network prefix length associated with the record. Example ------- .. code-block:: pycon >>> import maxminddb >>> >>> reader = maxminddb.open_database('GeoLite2-City.mmdb') >>> >>> reader.get('1.1.1.1') {'country': ... } >>> >>> reader.get_with_prefix_len('1.1.1.1') ({'country': ... }, 24) >>> >>> reader.close() Exceptions ---------- The module will return an ``InvalidDatabaseError`` if the database is corrupt or otherwise invalid. A ``ValueError`` will be thrown if you look up an invalid IP address or an IPv6 address in an IPv4 database. Requirements ------------ This code requires Python 2.7+ or 3.5+. Older versions are not supported. The C extension requires CPython. The pure Python implementation has been tested with PyPy. On Python 2, the `ipaddress module `_ is required. Versioning ---------- The MaxMind DB Python module uses `Semantic Versioning `_. Support ------- Please report all issues with this code using the `GitHub issue tracker `_ If you are having an issue with a MaxMind service that is not specific to this API, please contact `MaxMind support `_ for assistance. ././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3772535 maxminddb-1.5.2/docs/0000755000175000017500000000000000000000000014305 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.381254 maxminddb-1.5.2/docs/html/0000755000175000017500000000000000000000000015251 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/.buildinfo0000644000175000017500000000034600000000000017230 0ustar00greggreg00000000000000# Sphinx build info version 1 # This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done. config: f4b35ba4b456e07a1fe93fc0f298d57b tags: 645f666f9bcd5a90fca523b33c5a78b7 ././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.381254 maxminddb-1.5.2/docs/html/_sources/0000755000175000017500000000000000000000000017073 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1569616738.0 maxminddb-1.5.2/docs/html/_sources/index.rst.txt0000644000175000017500000000137200000000000021555 0ustar00greggreg00000000000000.. maxminddb documentation master file, created by sphinx-quickstart on Tue Apr 9 13:34:57 2013. You can adapt this file completely to your liking, but it should at least contain the root `toctree` directive. .. toctree:: :maxdepth: 3 .. include:: ../README.rst ======= Modules ======= .. automodule:: maxminddb :members: :undoc-members: :show-inheritance: .. automodule:: maxminddb.errors :members: :undoc-members: :show-inheritance: .. automodule:: maxminddb.reader :members: :undoc-members: :show-inheritance: ================== Indices and tables ================== * :ref:`genindex` * :ref:`modindex` * :ref:`search` :copyright: (c) 2013-2019 by MaxMind, Inc. :license: Apache License, Version 2.0 ././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3852544 maxminddb-1.5.2/docs/html/_static/0000755000175000017500000000000000000000000016677 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/_static/basic.css0000644000175000017500000002774500000000000020511 0ustar00greggreg00000000000000/* * basic.css * ~~~~~~~~~ * * Sphinx stylesheet -- basic theme. * * :copyright: Copyright 2007-2019 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */ /* -- main layout ----------------------------------------------------------- */ div.clearer { clear: both; } /* -- relbar ---------------------------------------------------------------- */ div.related { width: 100%; font-size: 90%; } div.related h3 { display: none; } div.related ul { margin: 0; padding: 0 0 0 10px; list-style: none; } div.related li { display: inline; } div.related li.right { float: right; margin-right: 5px; } /* -- sidebar --------------------------------------------------------------- */ div.sphinxsidebarwrapper { padding: 10px 5px 0 10px; } div.sphinxsidebar { float: left; width: 230px; margin-left: -100%; font-size: 90%; word-wrap: break-word; overflow-wrap : break-word; } div.sphinxsidebar ul { list-style: none; } div.sphinxsidebar ul ul, div.sphinxsidebar ul.want-points { margin-left: 20px; list-style: square; } div.sphinxsidebar ul ul { margin-top: 0; margin-bottom: 0; } div.sphinxsidebar form { margin-top: 10px; } div.sphinxsidebar input { border: 1px solid #98dbcc; font-family: sans-serif; font-size: 1em; } div.sphinxsidebar #searchbox form.search { overflow: hidden; } div.sphinxsidebar #searchbox input[type="text"] { float: left; width: 80%; padding: 0.25em; box-sizing: border-box; } div.sphinxsidebar #searchbox input[type="submit"] { float: left; width: 20%; border-left: none; padding: 0.25em; box-sizing: border-box; } img { border: 0; max-width: 100%; } /* -- search page ----------------------------------------------------------- */ ul.search { margin: 10px 0 0 20px; padding: 0; } ul.search li { padding: 5px 0 5px 20px; background-image: url(file.png); background-repeat: no-repeat; background-position: 0 7px; } ul.search li a { font-weight: bold; } ul.search li div.context { color: #888; margin: 2px 0 0 30px; text-align: left; } ul.keywordmatches li.goodmatch a { font-weight: bold; } /* -- index page ------------------------------------------------------------ */ table.contentstable { width: 90%; margin-left: auto; margin-right: auto; } table.contentstable p.biglink { line-height: 150%; } a.biglink { font-size: 1.3em; } span.linkdescr { font-style: italic; padding-top: 5px; font-size: 90%; } /* -- general index --------------------------------------------------------- */ table.indextable { width: 100%; } table.indextable td { text-align: left; vertical-align: top; } table.indextable ul { margin-top: 0; margin-bottom: 0; list-style-type: none; } table.indextable > tbody > tr > td > ul { padding-left: 0em; } table.indextable tr.pcap { height: 10px; } table.indextable tr.cap { margin-top: 10px; background-color: #f2f2f2; } img.toggler { margin-right: 3px; margin-top: 3px; cursor: pointer; } div.modindex-jumpbox { border-top: 1px solid #ddd; border-bottom: 1px solid #ddd; margin: 1em 0 1em 0; padding: 0.4em; } div.genindex-jumpbox { border-top: 1px solid #ddd; border-bottom: 1px solid #ddd; margin: 1em 0 1em 0; padding: 0.4em; } /* -- domain module index --------------------------------------------------- */ table.modindextable td { padding: 2px; border-collapse: collapse; } /* -- general body styles --------------------------------------------------- */ div.body { min-width: 450px; max-width: 800px; } div.body p, div.body dd, div.body li, div.body blockquote { -moz-hyphens: auto; -ms-hyphens: auto; -webkit-hyphens: auto; hyphens: auto; } a.headerlink { visibility: hidden; } a.brackets:before, span.brackets > a:before{ content: "["; } a.brackets:after, span.brackets > a:after { content: "]"; } h1:hover > a.headerlink, h2:hover > a.headerlink, h3:hover > a.headerlink, h4:hover > a.headerlink, h5:hover > a.headerlink, h6:hover > a.headerlink, dt:hover > a.headerlink, caption:hover > a.headerlink, p.caption:hover > a.headerlink, div.code-block-caption:hover > a.headerlink { visibility: visible; } div.body p.caption { text-align: inherit; } div.body td { text-align: left; } .first { margin-top: 0 !important; } p.rubric { margin-top: 30px; font-weight: bold; } img.align-left, .figure.align-left, object.align-left { clear: left; float: left; margin-right: 1em; } img.align-right, .figure.align-right, object.align-right { clear: right; float: right; margin-left: 1em; } img.align-center, .figure.align-center, object.align-center { display: block; margin-left: auto; margin-right: auto; } img.align-default, .figure.align-default { display: block; margin-left: auto; margin-right: auto; } .align-left { text-align: left; } .align-center { text-align: center; } .align-default { text-align: center; } .align-right { text-align: right; } /* -- sidebars -------------------------------------------------------------- */ div.sidebar { margin: 0 0 0.5em 1em; border: 1px solid #ddb; padding: 7px 7px 0 7px; background-color: #ffe; width: 40%; float: right; } p.sidebar-title { font-weight: bold; } /* -- topics ---------------------------------------------------------------- */ div.topic { border: 1px solid #ccc; padding: 7px 7px 0 7px; margin: 10px 0 10px 0; } p.topic-title { font-size: 1.1em; font-weight: bold; margin-top: 10px; } /* -- admonitions ----------------------------------------------------------- */ div.admonition { margin-top: 10px; margin-bottom: 10px; padding: 7px; } div.admonition dt { font-weight: bold; } div.admonition dl { margin-bottom: 0; } p.admonition-title { margin: 0px 10px 5px 0px; font-weight: bold; } div.body p.centered { text-align: center; margin-top: 25px; } /* -- tables ---------------------------------------------------------------- */ table.docutils { border: 0; border-collapse: collapse; } table.align-center { margin-left: auto; margin-right: auto; } table.align-default { margin-left: auto; margin-right: auto; } table caption span.caption-number { font-style: italic; } table caption span.caption-text { } table.docutils td, table.docutils th { padding: 1px 8px 1px 5px; border-top: 0; border-left: 0; border-right: 0; border-bottom: 1px solid #aaa; } table.footnote td, table.footnote th { border: 0 !important; } th { text-align: left; padding-right: 5px; } table.citation { border-left: solid 1px gray; margin-left: 1px; } table.citation td { border-bottom: none; } th > p:first-child, td > p:first-child { margin-top: 0px; } th > p:last-child, td > p:last-child { margin-bottom: 0px; } /* -- figures --------------------------------------------------------------- */ div.figure { margin: 0.5em; padding: 0.5em; } div.figure p.caption { padding: 0.3em; } div.figure p.caption span.caption-number { font-style: italic; } div.figure p.caption span.caption-text { } /* -- field list styles ----------------------------------------------------- */ table.field-list td, table.field-list th { border: 0 !important; } .field-list ul { margin: 0; padding-left: 1em; } .field-list p { margin: 0; } .field-name { -moz-hyphens: manual; -ms-hyphens: manual; -webkit-hyphens: manual; hyphens: manual; } /* -- hlist styles ---------------------------------------------------------- */ table.hlist td { vertical-align: top; } /* -- other body styles ----------------------------------------------------- */ ol.arabic { list-style: decimal; } ol.loweralpha { list-style: lower-alpha; } ol.upperalpha { list-style: upper-alpha; } ol.lowerroman { list-style: lower-roman; } ol.upperroman { list-style: upper-roman; } li > p:first-child { margin-top: 0px; } li > p:last-child { margin-bottom: 0px; } dl.footnote > dt, dl.citation > dt { float: left; } dl.footnote > dd, dl.citation > dd { margin-bottom: 0em; } dl.footnote > dd:after, dl.citation > dd:after { content: ""; clear: both; } dl.field-list { display: grid; grid-template-columns: fit-content(30%) auto; } dl.field-list > dt { font-weight: bold; word-break: break-word; padding-left: 0.5em; padding-right: 5px; } dl.field-list > dt:after { content: ":"; } dl.field-list > dd { padding-left: 0.5em; margin-top: 0em; margin-left: 0em; margin-bottom: 0em; } dl { margin-bottom: 15px; } dd > p:first-child { margin-top: 0px; } dd ul, dd table { margin-bottom: 10px; } dd { margin-top: 3px; margin-bottom: 10px; margin-left: 30px; } dt:target, span.highlighted { background-color: #fbe54e; } rect.highlighted { fill: #fbe54e; } dl.glossary dt { font-weight: bold; font-size: 1.1em; } .optional { font-size: 1.3em; } .sig-paren { font-size: larger; } .versionmodified { font-style: italic; } .system-message { background-color: #fda; padding: 5px; border: 3px solid red; } .footnote:target { background-color: #ffa; } .line-block { display: block; margin-top: 1em; margin-bottom: 1em; } .line-block .line-block { margin-top: 0; margin-bottom: 0; margin-left: 1.5em; } .guilabel, .menuselection { font-family: sans-serif; } .accelerator { text-decoration: underline; } .classifier { font-style: oblique; } .classifier:before { font-style: normal; margin: 0.5em; content: ":"; } abbr, acronym { border-bottom: dotted 1px; cursor: help; } /* -- code displays --------------------------------------------------------- */ pre { overflow: auto; overflow-y: hidden; /* fixes display issues on Chrome browsers */ } span.pre { -moz-hyphens: none; -ms-hyphens: none; -webkit-hyphens: none; hyphens: none; } td.linenos pre { padding: 5px 0px; border: 0; background-color: transparent; color: #aaa; } table.highlighttable { margin-left: 0.5em; } table.highlighttable td { padding: 0 0.5em 0 0.5em; } div.code-block-caption { padding: 2px 5px; font-size: small; } div.code-block-caption code { background-color: transparent; } div.code-block-caption + div > div.highlight > pre { margin-top: 0; } div.doctest > div.highlight span.gp { /* gp: Generic.Prompt */ user-select: none; } div.code-block-caption span.caption-number { padding: 0.1em 0.3em; font-style: italic; } div.code-block-caption span.caption-text { } div.literal-block-wrapper { padding: 1em 1em 0; } div.literal-block-wrapper div.highlight { margin: 0; } code.descname { background-color: transparent; font-weight: bold; font-size: 1.2em; } code.descclassname { background-color: transparent; } code.xref, a code { background-color: transparent; font-weight: bold; } h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { background-color: transparent; } .viewcode-link { float: right; } .viewcode-back { float: right; font-family: sans-serif; } div.viewcode-block:target { margin: -1px -10px; padding: 0 10px; } /* -- math display ---------------------------------------------------------- */ img.math { vertical-align: middle; } div.body div.math p { text-align: center; } span.eqno { float: right; } span.eqno a.headerlink { position: relative; left: 0px; z-index: 1; } div.math:hover a.headerlink { visibility: visible; } /* -- printout stylesheet --------------------------------------------------- */ @media print { div.document, div.documentwrapper, div.bodywrapper { margin: 0 !important; width: 100%; } div.sphinxsidebar, div.related, div.footer, #top-link { display: none; } }././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867315.0 maxminddb-1.5.2/docs/html/_static/contents.png0000644000175000017500000000015300000000000021241 0ustar00greggreg00000000000000PNG  IHDR( 2IDATx5@ĒXvխHqIHBZ ?y 4j}N.pIENDB`././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867315.0 maxminddb-1.5.2/docs/html/_static/doctools.js0000644000175000017500000002206600000000000021071 0ustar00greggreg00000000000000/* * doctools.js * ~~~~~~~~~~~ * * Sphinx JavaScript utilities for all documentation. * * :copyright: Copyright 2007-2019 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */ /** * select a different prefix for underscore */ $u = _.noConflict(); /** * make the code below compatible with browsers without * an installed firebug like debugger if (!window.console || !console.firebug) { var names = ["log", "debug", "info", "warn", "error", "assert", "dir", "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", "profile", "profileEnd"]; window.console = {}; for (var i = 0; i < names.length; ++i) window.console[names[i]] = function() {}; } */ /** * small helper function to urldecode strings */ jQuery.urldecode = function(x) { return decodeURIComponent(x).replace(/\+/g, ' '); }; /** * small helper function to urlencode strings */ jQuery.urlencode = encodeURIComponent; /** * This function returns the parsed url parameters of the * current request. Multiple values per key are supported, * it will always return arrays of strings for the value parts. */ jQuery.getQueryParameters = function(s) { if (typeof s === 'undefined') s = document.location.search; var parts = s.substr(s.indexOf('?') + 1).split('&'); var result = {}; for (var i = 0; i < parts.length; i++) { var tmp = parts[i].split('=', 2); var key = jQuery.urldecode(tmp[0]); var value = jQuery.urldecode(tmp[1]); if (key in result) result[key].push(value); else result[key] = [value]; } return result; }; /** * highlight a given string on a jquery object by wrapping it in * span elements with the given class name. */ jQuery.fn.highlightText = function(text, className) { function highlight(node, addItems) { if (node.nodeType === 3) { var val = node.nodeValue; var pos = val.toLowerCase().indexOf(text); if (pos >= 0 && !jQuery(node.parentNode).hasClass(className) && !jQuery(node.parentNode).hasClass("nohighlight")) { var span; var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg"); if (isInSVG) { span = document.createElementNS("http://www.w3.org/2000/svg", "tspan"); } else { span = document.createElement("span"); span.className = className; } span.appendChild(document.createTextNode(val.substr(pos, text.length))); node.parentNode.insertBefore(span, node.parentNode.insertBefore( document.createTextNode(val.substr(pos + text.length)), node.nextSibling)); node.nodeValue = val.substr(0, pos); if (isInSVG) { var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect"); var bbox = node.parentElement.getBBox(); rect.x.baseVal.value = bbox.x; rect.y.baseVal.value = bbox.y; rect.width.baseVal.value = bbox.width; rect.height.baseVal.value = bbox.height; rect.setAttribute('class', className); addItems.push({ "parent": node.parentNode, "target": rect}); } } } else if (!jQuery(node).is("button, select, textarea")) { jQuery.each(node.childNodes, function() { highlight(this, addItems); }); } } var addItems = []; var result = this.each(function() { highlight(this, addItems); }); for (var i = 0; i < addItems.length; ++i) { jQuery(addItems[i].parent).before(addItems[i].target); } return result; }; /* * backward compatibility for jQuery.browser * This will be supported until firefox bug is fixed. */ if (!jQuery.browser) { jQuery.uaMatch = function(ua) { ua = ua.toLowerCase(); var match = /(chrome)[ \/]([\w.]+)/.exec(ua) || /(webkit)[ \/]([\w.]+)/.exec(ua) || /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) || /(msie) ([\w.]+)/.exec(ua) || ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) || []; return { browser: match[ 1 ] || "", version: match[ 2 ] || "0" }; }; jQuery.browser = {}; jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true; } /** * Small JavaScript module for the documentation. */ var Documentation = { init : function() { this.fixFirefoxAnchorBug(); this.highlightSearchWords(); this.initIndexTable(); if (DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) { this.initOnKeyListeners(); } }, /** * i18n support */ TRANSLATIONS : {}, PLURAL_EXPR : function(n) { return n === 1 ? 0 : 1; }, LOCALE : 'unknown', // gettext and ngettext don't access this so that the functions // can safely bound to a different name (_ = Documentation.gettext) gettext : function(string) { var translated = Documentation.TRANSLATIONS[string]; if (typeof translated === 'undefined') return string; return (typeof translated === 'string') ? translated : translated[0]; }, ngettext : function(singular, plural, n) { var translated = Documentation.TRANSLATIONS[singular]; if (typeof translated === 'undefined') return (n == 1) ? singular : plural; return translated[Documentation.PLURALEXPR(n)]; }, addTranslations : function(catalog) { for (var key in catalog.messages) this.TRANSLATIONS[key] = catalog.messages[key]; this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')'); this.LOCALE = catalog.locale; }, /** * add context elements like header anchor links */ addContextElements : function() { $('div[id] > :header:first').each(function() { $('\u00B6'). attr('href', '#' + this.id). attr('title', _('Permalink to this headline')). appendTo(this); }); $('dt[id]').each(function() { $('\u00B6'). attr('href', '#' + this.id). attr('title', _('Permalink to this definition')). appendTo(this); }); }, /** * workaround a firefox stupidity * see: https://bugzilla.mozilla.org/show_bug.cgi?id=645075 */ fixFirefoxAnchorBug : function() { if (document.location.hash && $.browser.mozilla) window.setTimeout(function() { document.location.href += ''; }, 10); }, /** * highlight the search words provided in the url in the text */ highlightSearchWords : function() { var params = $.getQueryParameters(); var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : []; if (terms.length) { var body = $('div.body'); if (!body.length) { body = $('body'); } window.setTimeout(function() { $.each(terms, function() { body.highlightText(this.toLowerCase(), 'highlighted'); }); }, 10); $('

' + _('Hide Search Matches') + '

') .appendTo($('#searchbox')); } }, /** * init the domain index toggle buttons */ initIndexTable : function() { var togglers = $('img.toggler').click(function() { var src = $(this).attr('src'); var idnum = $(this).attr('id').substr(7); $('tr.cg-' + idnum).toggle(); if (src.substr(-9) === 'minus.png') $(this).attr('src', src.substr(0, src.length-9) + 'plus.png'); else $(this).attr('src', src.substr(0, src.length-8) + 'minus.png'); }).css('display', ''); if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) { togglers.click(); } }, /** * helper function to hide the search marks again */ hideSearchWords : function() { $('#searchbox .highlight-link').fadeOut(300); $('span.highlighted').removeClass('highlighted'); }, /** * make the url absolute */ makeURL : function(relativeURL) { return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL; }, /** * get the current relative url */ getCurrentURL : function() { var path = document.location.pathname; var parts = path.split(/\//); $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() { if (this === '..') parts.pop(); }); var url = parts.join('/'); return path.substring(url.lastIndexOf('/') + 1, path.length - 1); }, initOnKeyListeners: function() { $(document).keyup(function(event) { var activeElementType = document.activeElement.tagName; // don't navigate when in search box or textarea if (activeElementType !== 'TEXTAREA' && activeElementType !== 'INPUT' && activeElementType !== 'SELECT') { switch (event.keyCode) { case 37: // left var prevHref = $('link[rel="prev"]').prop('href'); if (prevHref) { window.location.href = prevHref; return false; } case 39: // right var nextHref = $('link[rel="next"]').prop('href'); if (nextHref) { window.location.href = nextHref; return false; } } } }); } }; // quick alias for translations _ = Documentation.gettext; $(document).ready(function() { Documentation.init(); }); ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/_static/documentation_options.js0000644000175000017500000000051100000000000023656 0ustar00greggreg00000000000000var DOCUMENTATION_OPTIONS = { URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'), VERSION: '1.5.2', LANGUAGE: 'None', COLLAPSE_INDEX: false, BUILDER: 'html', FILE_SUFFIX: '.html', HAS_SOURCE: true, SOURCELINK_SUFFIX: '.txt', NAVIGATION_WITH_KEYS: false };././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867315.0 maxminddb-1.5.2/docs/html/_static/file.png0000644000175000017500000000043600000000000020327 0ustar00greggreg00000000000000PNG  IHDRaIDATxR){l ۶f=@ :3~箄rX$AX-D ~ lj(P%8<<9:: PO&$ l~X&EW^4wQ}^ͣ i0/H/@F)Dzq+j[SU5h/oY G&Lfs|{3%U+S`AFIENDB`././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867315.0 maxminddb-1.5.2/docs/html/_static/jquery-3.4.1.js0000644000175000017500000104345400000000000021230 0ustar00greggreg00000000000000/*! * jQuery JavaScript Library v3.4.1 * https://jquery.com/ * * Includes Sizzle.js * https://sizzlejs.com/ * * Copyright JS Foundation and other contributors * Released under the MIT license * https://jquery.org/license * * Date: 2019-05-01T21:04Z */ ( function( global, factory ) { "use strict"; if ( typeof module === "object" && typeof module.exports === "object" ) { // For CommonJS and CommonJS-like environments where a proper `window` // is present, execute the factory and get jQuery. // For environments that do not have a `window` with a `document` // (such as Node.js), expose a factory as module.exports. // This accentuates the need for the creation of a real `window`. // e.g. var jQuery = require("jquery")(window); // See ticket #14549 for more info. module.exports = global.document ? factory( global, true ) : function( w ) { if ( !w.document ) { throw new Error( "jQuery requires a window with a document" ); } return factory( w ); }; } else { factory( global ); } // Pass this if window is not defined yet } )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { // Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 // throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode // arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common // enough that all such attempts are guarded in a try block. "use strict"; var arr = []; var document = window.document; var getProto = Object.getPrototypeOf; var slice = arr.slice; var concat = arr.concat; var push = arr.push; var indexOf = arr.indexOf; var class2type = {}; var toString = class2type.toString; var hasOwn = class2type.hasOwnProperty; var fnToString = hasOwn.toString; var ObjectFunctionString = fnToString.call( Object ); var support = {}; var isFunction = function isFunction( obj ) { // Support: Chrome <=57, Firefox <=52 // In some browsers, typeof returns "function" for HTML elements // (i.e., `typeof document.createElement( "object" ) === "function"`). // We don't want to classify *any* DOM node as a function. return typeof obj === "function" && typeof obj.nodeType !== "number"; }; var isWindow = function isWindow( obj ) { return obj != null && obj === obj.window; }; var preservedScriptAttributes = { type: true, src: true, nonce: true, noModule: true }; function DOMEval( code, node, doc ) { doc = doc || document; var i, val, script = doc.createElement( "script" ); script.text = code; if ( node ) { for ( i in preservedScriptAttributes ) { // Support: Firefox 64+, Edge 18+ // Some browsers don't support the "nonce" property on scripts. // On the other hand, just using `getAttribute` is not enough as // the `nonce` attribute is reset to an empty string whenever it // becomes browsing-context connected. // See https://github.com/whatwg/html/issues/2369 // See https://html.spec.whatwg.org/#nonce-attributes // The `node.getAttribute` check was added for the sake of // `jQuery.globalEval` so that it can fake a nonce-containing node // via an object. val = node[ i ] || node.getAttribute && node.getAttribute( i ); if ( val ) { script.setAttribute( i, val ); } } } doc.head.appendChild( script ).parentNode.removeChild( script ); } function toType( obj ) { if ( obj == null ) { return obj + ""; } // Support: Android <=2.3 only (functionish RegExp) return typeof obj === "object" || typeof obj === "function" ? class2type[ toString.call( obj ) ] || "object" : typeof obj; } /* global Symbol */ // Defining this global in .eslintrc.json would create a danger of using the global // unguarded in another place, it seems safer to define global only for this module var version = "3.4.1", // Define a local copy of jQuery jQuery = function( selector, context ) { // The jQuery object is actually just the init constructor 'enhanced' // Need init if jQuery is called (just allow error to be thrown if not included) return new jQuery.fn.init( selector, context ); }, // Support: Android <=4.0 only // Make sure we trim BOM and NBSP rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g; jQuery.fn = jQuery.prototype = { // The current version of jQuery being used jquery: version, constructor: jQuery, // The default length of a jQuery object is 0 length: 0, toArray: function() { return slice.call( this ); }, // Get the Nth element in the matched element set OR // Get the whole matched element set as a clean array get: function( num ) { // Return all the elements in a clean array if ( num == null ) { return slice.call( this ); } // Return just the one element from the set return num < 0 ? this[ num + this.length ] : this[ num ]; }, // Take an array of elements and push it onto the stack // (returning the new matched element set) pushStack: function( elems ) { // Build a new jQuery matched element set var ret = jQuery.merge( this.constructor(), elems ); // Add the old object onto the stack (as a reference) ret.prevObject = this; // Return the newly-formed element set return ret; }, // Execute a callback for every element in the matched set. each: function( callback ) { return jQuery.each( this, callback ); }, map: function( callback ) { return this.pushStack( jQuery.map( this, function( elem, i ) { return callback.call( elem, i, elem ); } ) ); }, slice: function() { return this.pushStack( slice.apply( this, arguments ) ); }, first: function() { return this.eq( 0 ); }, last: function() { return this.eq( -1 ); }, eq: function( i ) { var len = this.length, j = +i + ( i < 0 ? len : 0 ); return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); }, end: function() { return this.prevObject || this.constructor(); }, // For internal use only. // Behaves like an Array's method, not like a jQuery method. push: push, sort: arr.sort, splice: arr.splice }; jQuery.extend = jQuery.fn.extend = function() { var options, name, src, copy, copyIsArray, clone, target = arguments[ 0 ] || {}, i = 1, length = arguments.length, deep = false; // Handle a deep copy situation if ( typeof target === "boolean" ) { deep = target; // Skip the boolean and the target target = arguments[ i ] || {}; i++; } // Handle case when target is a string or something (possible in deep copy) if ( typeof target !== "object" && !isFunction( target ) ) { target = {}; } // Extend jQuery itself if only one argument is passed if ( i === length ) { target = this; i--; } for ( ; i < length; i++ ) { // Only deal with non-null/undefined values if ( ( options = arguments[ i ] ) != null ) { // Extend the base object for ( name in options ) { copy = options[ name ]; // Prevent Object.prototype pollution // Prevent never-ending loop if ( name === "__proto__" || target === copy ) { continue; } // Recurse if we're merging plain objects or arrays if ( deep && copy && ( jQuery.isPlainObject( copy ) || ( copyIsArray = Array.isArray( copy ) ) ) ) { src = target[ name ]; // Ensure proper type for the source value if ( copyIsArray && !Array.isArray( src ) ) { clone = []; } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { clone = {}; } else { clone = src; } copyIsArray = false; // Never move original objects, clone them target[ name ] = jQuery.extend( deep, clone, copy ); // Don't bring in undefined values } else if ( copy !== undefined ) { target[ name ] = copy; } } } } // Return the modified object return target; }; jQuery.extend( { // Unique for each copy of jQuery on the page expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), // Assume jQuery is ready without the ready module isReady: true, error: function( msg ) { throw new Error( msg ); }, noop: function() {}, isPlainObject: function( obj ) { var proto, Ctor; // Detect obvious negatives // Use toString instead of jQuery.type to catch host objects if ( !obj || toString.call( obj ) !== "[object Object]" ) { return false; } proto = getProto( obj ); // Objects with no prototype (e.g., `Object.create( null )`) are plain if ( !proto ) { return true; } // Objects with prototype are plain iff they were constructed by a global Object function Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; }, isEmptyObject: function( obj ) { var name; for ( name in obj ) { return false; } return true; }, // Evaluates a script in a global context globalEval: function( code, options ) { DOMEval( code, { nonce: options && options.nonce } ); }, each: function( obj, callback ) { var length, i = 0; if ( isArrayLike( obj ) ) { length = obj.length; for ( ; i < length; i++ ) { if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { break; } } } else { for ( i in obj ) { if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { break; } } } return obj; }, // Support: Android <=4.0 only trim: function( text ) { return text == null ? "" : ( text + "" ).replace( rtrim, "" ); }, // results is for internal usage only makeArray: function( arr, results ) { var ret = results || []; if ( arr != null ) { if ( isArrayLike( Object( arr ) ) ) { jQuery.merge( ret, typeof arr === "string" ? [ arr ] : arr ); } else { push.call( ret, arr ); } } return ret; }, inArray: function( elem, arr, i ) { return arr == null ? -1 : indexOf.call( arr, elem, i ); }, // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit merge: function( first, second ) { var len = +second.length, j = 0, i = first.length; for ( ; j < len; j++ ) { first[ i++ ] = second[ j ]; } first.length = i; return first; }, grep: function( elems, callback, invert ) { var callbackInverse, matches = [], i = 0, length = elems.length, callbackExpect = !invert; // Go through the array, only saving the items // that pass the validator function for ( ; i < length; i++ ) { callbackInverse = !callback( elems[ i ], i ); if ( callbackInverse !== callbackExpect ) { matches.push( elems[ i ] ); } } return matches; }, // arg is for internal usage only map: function( elems, callback, arg ) { var length, value, i = 0, ret = []; // Go through the array, translating each of the items to their new values if ( isArrayLike( elems ) ) { length = elems.length; for ( ; i < length; i++ ) { value = callback( elems[ i ], i, arg ); if ( value != null ) { ret.push( value ); } } // Go through every key on the object, } else { for ( i in elems ) { value = callback( elems[ i ], i, arg ); if ( value != null ) { ret.push( value ); } } } // Flatten any nested arrays return concat.apply( [], ret ); }, // A global GUID counter for objects guid: 1, // jQuery.support is not used in Core but other projects attach their // properties to it so it needs to exist. support: support } ); if ( typeof Symbol === "function" ) { jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; } // Populate the class2type map jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), function( i, name ) { class2type[ "[object " + name + "]" ] = name.toLowerCase(); } ); function isArrayLike( obj ) { // Support: real iOS 8.2 only (not reproducible in simulator) // `in` check used to prevent JIT error (gh-2145) // hasOwn isn't used here due to false negatives // regarding Nodelist length in IE var length = !!obj && "length" in obj && obj.length, type = toType( obj ); if ( isFunction( obj ) || isWindow( obj ) ) { return false; } return type === "array" || length === 0 || typeof length === "number" && length > 0 && ( length - 1 ) in obj; } var Sizzle = /*! * Sizzle CSS Selector Engine v2.3.4 * https://sizzlejs.com/ * * Copyright JS Foundation and other contributors * Released under the MIT license * https://js.foundation/ * * Date: 2019-04-08 */ (function( window ) { var i, support, Expr, getText, isXML, tokenize, compile, select, outermostContext, sortInput, hasDuplicate, // Local document vars setDocument, document, docElem, documentIsHTML, rbuggyQSA, rbuggyMatches, matches, contains, // Instance-specific data expando = "sizzle" + 1 * new Date(), preferredDoc = window.document, dirruns = 0, done = 0, classCache = createCache(), tokenCache = createCache(), compilerCache = createCache(), nonnativeSelectorCache = createCache(), sortOrder = function( a, b ) { if ( a === b ) { hasDuplicate = true; } return 0; }, // Instance methods hasOwn = ({}).hasOwnProperty, arr = [], pop = arr.pop, push_native = arr.push, push = arr.push, slice = arr.slice, // Use a stripped-down indexOf as it's faster than native // https://jsperf.com/thor-indexof-vs-for/5 indexOf = function( list, elem ) { var i = 0, len = list.length; for ( ; i < len; i++ ) { if ( list[i] === elem ) { return i; } } return -1; }, booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped", // Regular expressions // http://www.w3.org/TR/css3-selectors/#whitespace whitespace = "[\\x20\\t\\r\\n\\f]", // http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier identifier = "(?:\\\\.|[\\w-]|[^\0-\\xa0])+", // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + // Operator (capture 2) "*([*^$|!~]?=)" + whitespace + // "Attribute values must be CSS identifiers [capture 5] or strings [capture 3 or capture 4]" "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + whitespace + "*\\]", pseudos = ":(" + identifier + ")(?:\\((" + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: // 1. quoted (capture 3; capture 4 or capture 5) "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + // 2. simple (capture 6) "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + // 3. anything else (capture 2) ".*" + ")\\)|)", // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter rwhitespace = new RegExp( whitespace + "+", "g" ), rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$", "g" ), rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + "*" ), rdescend = new RegExp( whitespace + "|>" ), rpseudo = new RegExp( pseudos ), ridentifier = new RegExp( "^" + identifier + "$" ), matchExpr = { "ID": new RegExp( "^#(" + identifier + ")" ), "CLASS": new RegExp( "^\\.(" + identifier + ")" ), "TAG": new RegExp( "^(" + identifier + "|[*])" ), "ATTR": new RegExp( "^" + attributes ), "PSEUDO": new RegExp( "^" + pseudos ), "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), // For use in libraries implementing .is() // We use this for POS matching in `select` "needsContext": new RegExp( "^" + whitespace + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) }, rhtml = /HTML$/i, rinputs = /^(?:input|select|textarea|button)$/i, rheader = /^h\d$/i, rnative = /^[^{]+\{\s*\[native \w/, // Easily-parseable/retrievable ID or TAG or CLASS selectors rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, rsibling = /[+~]/, // CSS escapes // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters runescape = new RegExp( "\\\\([\\da-f]{1,6}" + whitespace + "?|(" + whitespace + ")|.)", "ig" ), funescape = function( _, escaped, escapedWhitespace ) { var high = "0x" + escaped - 0x10000; // NaN means non-codepoint // Support: Firefox<24 // Workaround erroneous numeric interpretation of +"0x" return high !== high || escapedWhitespace ? escaped : high < 0 ? // BMP codepoint String.fromCharCode( high + 0x10000 ) : // Supplemental Plane codepoint (surrogate pair) String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); }, // CSS string/identifier serialization // https://drafts.csswg.org/cssom/#common-serializing-idioms rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, fcssescape = function( ch, asCodePoint ) { if ( asCodePoint ) { // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER if ( ch === "\0" ) { return "\uFFFD"; } // Control characters and (dependent upon position) numbers get escaped as code points return ch.slice( 0, -1 ) + "\\" + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; } // Other potentially-special ASCII characters get backslash-escaped return "\\" + ch; }, // Used for iframes // See setDocument() // Removing the function wrapper causes a "Permission Denied" // error in IE unloadHandler = function() { setDocument(); }, inDisabledFieldset = addCombinator( function( elem ) { return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; }, { dir: "parentNode", next: "legend" } ); // Optimize for push.apply( _, NodeList ) try { push.apply( (arr = slice.call( preferredDoc.childNodes )), preferredDoc.childNodes ); // Support: Android<4.0 // Detect silently failing push.apply arr[ preferredDoc.childNodes.length ].nodeType; } catch ( e ) { push = { apply: arr.length ? // Leverage slice if possible function( target, els ) { push_native.apply( target, slice.call(els) ); } : // Support: IE<9 // Otherwise append directly function( target, els ) { var j = target.length, i = 0; // Can't trust NodeList.length while ( (target[j++] = els[i++]) ) {} target.length = j - 1; } }; } function Sizzle( selector, context, results, seed ) { var m, i, elem, nid, match, groups, newSelector, newContext = context && context.ownerDocument, // nodeType defaults to 9, since context defaults to document nodeType = context ? context.nodeType : 9; results = results || []; // Return early from calls with invalid selector or context if ( typeof selector !== "string" || !selector || nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { return results; } // Try to shortcut find operations (as opposed to filters) in HTML documents if ( !seed ) { if ( ( context ? context.ownerDocument || context : preferredDoc ) !== document ) { setDocument( context ); } context = context || document; if ( documentIsHTML ) { // If the selector is sufficiently simple, try using a "get*By*" DOM method // (excepting DocumentFragment context, where the methods don't exist) if ( nodeType !== 11 && (match = rquickExpr.exec( selector )) ) { // ID selector if ( (m = match[1]) ) { // Document context if ( nodeType === 9 ) { if ( (elem = context.getElementById( m )) ) { // Support: IE, Opera, Webkit // TODO: identify versions // getElementById can match elements by name instead of ID if ( elem.id === m ) { results.push( elem ); return results; } } else { return results; } // Element context } else { // Support: IE, Opera, Webkit // TODO: identify versions // getElementById can match elements by name instead of ID if ( newContext && (elem = newContext.getElementById( m )) && contains( context, elem ) && elem.id === m ) { results.push( elem ); return results; } } // Type selector } else if ( match[2] ) { push.apply( results, context.getElementsByTagName( selector ) ); return results; // Class selector } else if ( (m = match[3]) && support.getElementsByClassName && context.getElementsByClassName ) { push.apply( results, context.getElementsByClassName( m ) ); return results; } } // Take advantage of querySelectorAll if ( support.qsa && !nonnativeSelectorCache[ selector + " " ] && (!rbuggyQSA || !rbuggyQSA.test( selector )) && // Support: IE 8 only // Exclude object elements (nodeType !== 1 || context.nodeName.toLowerCase() !== "object") ) { newSelector = selector; newContext = context; // qSA considers elements outside a scoping root when evaluating child or // descendant combinators, which is not what we want. // In such cases, we work around the behavior by prefixing every selector in the // list with an ID selector referencing the scope context. // Thanks to Andrew Dupont for this technique. if ( nodeType === 1 && rdescend.test( selector ) ) { // Capture the context ID, setting it first if necessary if ( (nid = context.getAttribute( "id" )) ) { nid = nid.replace( rcssescape, fcssescape ); } else { context.setAttribute( "id", (nid = expando) ); } // Prefix every selector in the list groups = tokenize( selector ); i = groups.length; while ( i-- ) { groups[i] = "#" + nid + " " + toSelector( groups[i] ); } newSelector = groups.join( "," ); // Expand context for sibling selectors newContext = rsibling.test( selector ) && testContext( context.parentNode ) || context; } try { push.apply( results, newContext.querySelectorAll( newSelector ) ); return results; } catch ( qsaError ) { nonnativeSelectorCache( selector, true ); } finally { if ( nid === expando ) { context.removeAttribute( "id" ); } } } } } // All others return select( selector.replace( rtrim, "$1" ), context, results, seed ); } /** * Create key-value caches of limited size * @returns {function(string, object)} Returns the Object data after storing it on itself with * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) * deleting the oldest entry */ function createCache() { var keys = []; function cache( key, value ) { // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) if ( keys.push( key + " " ) > Expr.cacheLength ) { // Only keep the most recent entries delete cache[ keys.shift() ]; } return (cache[ key + " " ] = value); } return cache; } /** * Mark a function for special use by Sizzle * @param {Function} fn The function to mark */ function markFunction( fn ) { fn[ expando ] = true; return fn; } /** * Support testing using an element * @param {Function} fn Passed the created element and returns a boolean result */ function assert( fn ) { var el = document.createElement("fieldset"); try { return !!fn( el ); } catch (e) { return false; } finally { // Remove from its parent by default if ( el.parentNode ) { el.parentNode.removeChild( el ); } // release memory in IE el = null; } } /** * Adds the same handler for all of the specified attrs * @param {String} attrs Pipe-separated list of attributes * @param {Function} handler The method that will be applied */ function addHandle( attrs, handler ) { var arr = attrs.split("|"), i = arr.length; while ( i-- ) { Expr.attrHandle[ arr[i] ] = handler; } } /** * Checks document order of two siblings * @param {Element} a * @param {Element} b * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b */ function siblingCheck( a, b ) { var cur = b && a, diff = cur && a.nodeType === 1 && b.nodeType === 1 && a.sourceIndex - b.sourceIndex; // Use IE sourceIndex if available on both nodes if ( diff ) { return diff; } // Check if b follows a if ( cur ) { while ( (cur = cur.nextSibling) ) { if ( cur === b ) { return -1; } } } return a ? 1 : -1; } /** * Returns a function to use in pseudos for input types * @param {String} type */ function createInputPseudo( type ) { return function( elem ) { var name = elem.nodeName.toLowerCase(); return name === "input" && elem.type === type; }; } /** * Returns a function to use in pseudos for buttons * @param {String} type */ function createButtonPseudo( type ) { return function( elem ) { var name = elem.nodeName.toLowerCase(); return (name === "input" || name === "button") && elem.type === type; }; } /** * Returns a function to use in pseudos for :enabled/:disabled * @param {Boolean} disabled true for :disabled; false for :enabled */ function createDisabledPseudo( disabled ) { // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable return function( elem ) { // Only certain elements can match :enabled or :disabled // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled if ( "form" in elem ) { // Check for inherited disabledness on relevant non-disabled elements: // * listed form-associated elements in a disabled fieldset // https://html.spec.whatwg.org/multipage/forms.html#category-listed // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled // * option elements in a disabled optgroup // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled // All such elements have a "form" property. if ( elem.parentNode && elem.disabled === false ) { // Option elements defer to a parent optgroup if present if ( "label" in elem ) { if ( "label" in elem.parentNode ) { return elem.parentNode.disabled === disabled; } else { return elem.disabled === disabled; } } // Support: IE 6 - 11 // Use the isDisabled shortcut property to check for disabled fieldset ancestors return elem.isDisabled === disabled || // Where there is no isDisabled, check manually /* jshint -W018 */ elem.isDisabled !== !disabled && inDisabledFieldset( elem ) === disabled; } return elem.disabled === disabled; // Try to winnow out elements that can't be disabled before trusting the disabled property. // Some victims get caught in our net (label, legend, menu, track), but it shouldn't // even exist on them, let alone have a boolean value. } else if ( "label" in elem ) { return elem.disabled === disabled; } // Remaining elements are neither :enabled nor :disabled return false; }; } /** * Returns a function to use in pseudos for positionals * @param {Function} fn */ function createPositionalPseudo( fn ) { return markFunction(function( argument ) { argument = +argument; return markFunction(function( seed, matches ) { var j, matchIndexes = fn( [], seed.length, argument ), i = matchIndexes.length; // Match elements found at the specified indexes while ( i-- ) { if ( seed[ (j = matchIndexes[i]) ] ) { seed[j] = !(matches[j] = seed[j]); } } }); }); } /** * Checks a node for validity as a Sizzle context * @param {Element|Object=} context * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value */ function testContext( context ) { return context && typeof context.getElementsByTagName !== "undefined" && context; } // Expose support vars for convenience support = Sizzle.support = {}; /** * Detects XML nodes * @param {Element|Object} elem An element or a document * @returns {Boolean} True iff elem is a non-HTML XML node */ isXML = Sizzle.isXML = function( elem ) { var namespace = elem.namespaceURI, docElem = (elem.ownerDocument || elem).documentElement; // Support: IE <=8 // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes // https://bugs.jquery.com/ticket/4833 return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); }; /** * Sets document-related variables once based on the current document * @param {Element|Object} [doc] An element or document object to use to set the document * @returns {Object} Returns the current document */ setDocument = Sizzle.setDocument = function( node ) { var hasCompare, subWindow, doc = node ? node.ownerDocument || node : preferredDoc; // Return early if doc is invalid or already selected if ( doc === document || doc.nodeType !== 9 || !doc.documentElement ) { return document; } // Update global variables document = doc; docElem = document.documentElement; documentIsHTML = !isXML( document ); // Support: IE 9-11, Edge // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) if ( preferredDoc !== document && (subWindow = document.defaultView) && subWindow.top !== subWindow ) { // Support: IE 11, Edge if ( subWindow.addEventListener ) { subWindow.addEventListener( "unload", unloadHandler, false ); // Support: IE 9 - 10 only } else if ( subWindow.attachEvent ) { subWindow.attachEvent( "onunload", unloadHandler ); } } /* Attributes ---------------------------------------------------------------------- */ // Support: IE<8 // Verify that getAttribute really returns attributes and not properties // (excepting IE8 booleans) support.attributes = assert(function( el ) { el.className = "i"; return !el.getAttribute("className"); }); /* getElement(s)By* ---------------------------------------------------------------------- */ // Check if getElementsByTagName("*") returns only elements support.getElementsByTagName = assert(function( el ) { el.appendChild( document.createComment("") ); return !el.getElementsByTagName("*").length; }); // Support: IE<9 support.getElementsByClassName = rnative.test( document.getElementsByClassName ); // Support: IE<10 // Check if getElementById returns elements by name // The broken getElementById methods don't pick up programmatically-set names, // so use a roundabout getElementsByName test support.getById = assert(function( el ) { docElem.appendChild( el ).id = expando; return !document.getElementsByName || !document.getElementsByName( expando ).length; }); // ID filter and find if ( support.getById ) { Expr.filter["ID"] = function( id ) { var attrId = id.replace( runescape, funescape ); return function( elem ) { return elem.getAttribute("id") === attrId; }; }; Expr.find["ID"] = function( id, context ) { if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { var elem = context.getElementById( id ); return elem ? [ elem ] : []; } }; } else { Expr.filter["ID"] = function( id ) { var attrId = id.replace( runescape, funescape ); return function( elem ) { var node = typeof elem.getAttributeNode !== "undefined" && elem.getAttributeNode("id"); return node && node.value === attrId; }; }; // Support: IE 6 - 7 only // getElementById is not reliable as a find shortcut Expr.find["ID"] = function( id, context ) { if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { var node, i, elems, elem = context.getElementById( id ); if ( elem ) { // Verify the id attribute node = elem.getAttributeNode("id"); if ( node && node.value === id ) { return [ elem ]; } // Fall back on getElementsByName elems = context.getElementsByName( id ); i = 0; while ( (elem = elems[i++]) ) { node = elem.getAttributeNode("id"); if ( node && node.value === id ) { return [ elem ]; } } } return []; } }; } // Tag Expr.find["TAG"] = support.getElementsByTagName ? function( tag, context ) { if ( typeof context.getElementsByTagName !== "undefined" ) { return context.getElementsByTagName( tag ); // DocumentFragment nodes don't have gEBTN } else if ( support.qsa ) { return context.querySelectorAll( tag ); } } : function( tag, context ) { var elem, tmp = [], i = 0, // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too results = context.getElementsByTagName( tag ); // Filter out possible comments if ( tag === "*" ) { while ( (elem = results[i++]) ) { if ( elem.nodeType === 1 ) { tmp.push( elem ); } } return tmp; } return results; }; // Class Expr.find["CLASS"] = support.getElementsByClassName && function( className, context ) { if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { return context.getElementsByClassName( className ); } }; /* QSA/matchesSelector ---------------------------------------------------------------------- */ // QSA and matchesSelector support // matchesSelector(:active) reports false when true (IE9/Opera 11.5) rbuggyMatches = []; // qSa(:focus) reports false when true (Chrome 21) // We allow this because of a bug in IE8/9 that throws an error // whenever `document.activeElement` is accessed on an iframe // So, we allow :focus to pass through QSA all the time to avoid the IE error // See https://bugs.jquery.com/ticket/13378 rbuggyQSA = []; if ( (support.qsa = rnative.test( document.querySelectorAll )) ) { // Build QSA regex // Regex strategy adopted from Diego Perini assert(function( el ) { // Select is set to empty string on purpose // This is to test IE's treatment of not explicitly // setting a boolean content attribute, // since its presence should be enough // https://bugs.jquery.com/ticket/12359 docElem.appendChild( el ).innerHTML = "" + ""; // Support: IE8, Opera 11-12.16 // Nothing should be selected when empty strings follow ^= or $= or *= // The test attribute must be unknown in Opera but "safe" for WinRT // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section if ( el.querySelectorAll("[msallowcapture^='']").length ) { rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); } // Support: IE8 // Boolean attributes and "value" are not treated correctly if ( !el.querySelectorAll("[selected]").length ) { rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); } // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { rbuggyQSA.push("~="); } // Webkit/Opera - :checked should return selected option elements // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked // IE8 throws error here and will not see later tests if ( !el.querySelectorAll(":checked").length ) { rbuggyQSA.push(":checked"); } // Support: Safari 8+, iOS 8+ // https://bugs.webkit.org/show_bug.cgi?id=136851 // In-page `selector#id sibling-combinator selector` fails if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { rbuggyQSA.push(".#.+[+~]"); } }); assert(function( el ) { el.innerHTML = "" + ""; // Support: Windows 8 Native Apps // The type and name attributes are restricted during .innerHTML assignment var input = document.createElement("input"); input.setAttribute( "type", "hidden" ); el.appendChild( input ).setAttribute( "name", "D" ); // Support: IE8 // Enforce case-sensitivity of name attribute if ( el.querySelectorAll("[name=d]").length ) { rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); } // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) // IE8 throws error here and will not see later tests if ( el.querySelectorAll(":enabled").length !== 2 ) { rbuggyQSA.push( ":enabled", ":disabled" ); } // Support: IE9-11+ // IE's :disabled selector does not pick up the children of disabled fieldsets docElem.appendChild( el ).disabled = true; if ( el.querySelectorAll(":disabled").length !== 2 ) { rbuggyQSA.push( ":enabled", ":disabled" ); } // Opera 10-11 does not throw on post-comma invalid pseudos el.querySelectorAll("*,:x"); rbuggyQSA.push(",.*:"); }); } if ( (support.matchesSelector = rnative.test( (matches = docElem.matches || docElem.webkitMatchesSelector || docElem.mozMatchesSelector || docElem.oMatchesSelector || docElem.msMatchesSelector) )) ) { assert(function( el ) { // Check to see if it's possible to do matchesSelector // on a disconnected node (IE 9) support.disconnectedMatch = matches.call( el, "*" ); // This should fail with an exception // Gecko does not error, returns false instead matches.call( el, "[s!='']:x" ); rbuggyMatches.push( "!=", pseudos ); }); } rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join("|") ); rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join("|") ); /* Contains ---------------------------------------------------------------------- */ hasCompare = rnative.test( docElem.compareDocumentPosition ); // Element contains another // Purposefully self-exclusive // As in, an element does not contain itself contains = hasCompare || rnative.test( docElem.contains ) ? function( a, b ) { var adown = a.nodeType === 9 ? a.documentElement : a, bup = b && b.parentNode; return a === bup || !!( bup && bup.nodeType === 1 && ( adown.contains ? adown.contains( bup ) : a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 )); } : function( a, b ) { if ( b ) { while ( (b = b.parentNode) ) { if ( b === a ) { return true; } } } return false; }; /* Sorting ---------------------------------------------------------------------- */ // Document order sorting sortOrder = hasCompare ? function( a, b ) { // Flag for duplicate removal if ( a === b ) { hasDuplicate = true; return 0; } // Sort on method existence if only one input has compareDocumentPosition var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; if ( compare ) { return compare; } // Calculate position if both inputs belong to the same document compare = ( a.ownerDocument || a ) === ( b.ownerDocument || b ) ? a.compareDocumentPosition( b ) : // Otherwise we know they are disconnected 1; // Disconnected nodes if ( compare & 1 || (!support.sortDetached && b.compareDocumentPosition( a ) === compare) ) { // Choose the first element that is related to our preferred document if ( a === document || a.ownerDocument === preferredDoc && contains(preferredDoc, a) ) { return -1; } if ( b === document || b.ownerDocument === preferredDoc && contains(preferredDoc, b) ) { return 1; } // Maintain original order return sortInput ? ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : 0; } return compare & 4 ? -1 : 1; } : function( a, b ) { // Exit early if the nodes are identical if ( a === b ) { hasDuplicate = true; return 0; } var cur, i = 0, aup = a.parentNode, bup = b.parentNode, ap = [ a ], bp = [ b ]; // Parentless nodes are either documents or disconnected if ( !aup || !bup ) { return a === document ? -1 : b === document ? 1 : aup ? -1 : bup ? 1 : sortInput ? ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : 0; // If the nodes are siblings, we can do a quick check } else if ( aup === bup ) { return siblingCheck( a, b ); } // Otherwise we need full lists of their ancestors for comparison cur = a; while ( (cur = cur.parentNode) ) { ap.unshift( cur ); } cur = b; while ( (cur = cur.parentNode) ) { bp.unshift( cur ); } // Walk down the tree looking for a discrepancy while ( ap[i] === bp[i] ) { i++; } return i ? // Do a sibling check if the nodes have a common ancestor siblingCheck( ap[i], bp[i] ) : // Otherwise nodes in our document sort first ap[i] === preferredDoc ? -1 : bp[i] === preferredDoc ? 1 : 0; }; return document; }; Sizzle.matches = function( expr, elements ) { return Sizzle( expr, null, null, elements ); }; Sizzle.matchesSelector = function( elem, expr ) { // Set document vars if needed if ( ( elem.ownerDocument || elem ) !== document ) { setDocument( elem ); } if ( support.matchesSelector && documentIsHTML && !nonnativeSelectorCache[ expr + " " ] && ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { try { var ret = matches.call( elem, expr ); // IE 9's matchesSelector returns false on disconnected nodes if ( ret || support.disconnectedMatch || // As well, disconnected nodes are said to be in a document // fragment in IE 9 elem.document && elem.document.nodeType !== 11 ) { return ret; } } catch (e) { nonnativeSelectorCache( expr, true ); } } return Sizzle( expr, document, null, [ elem ] ).length > 0; }; Sizzle.contains = function( context, elem ) { // Set document vars if needed if ( ( context.ownerDocument || context ) !== document ) { setDocument( context ); } return contains( context, elem ); }; Sizzle.attr = function( elem, name ) { // Set document vars if needed if ( ( elem.ownerDocument || elem ) !== document ) { setDocument( elem ); } var fn = Expr.attrHandle[ name.toLowerCase() ], // Don't get fooled by Object.prototype properties (jQuery #13807) val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? fn( elem, name, !documentIsHTML ) : undefined; return val !== undefined ? val : support.attributes || !documentIsHTML ? elem.getAttribute( name ) : (val = elem.getAttributeNode(name)) && val.specified ? val.value : null; }; Sizzle.escape = function( sel ) { return (sel + "").replace( rcssescape, fcssescape ); }; Sizzle.error = function( msg ) { throw new Error( "Syntax error, unrecognized expression: " + msg ); }; /** * Document sorting and removing duplicates * @param {ArrayLike} results */ Sizzle.uniqueSort = function( results ) { var elem, duplicates = [], j = 0, i = 0; // Unless we *know* we can detect duplicates, assume their presence hasDuplicate = !support.detectDuplicates; sortInput = !support.sortStable && results.slice( 0 ); results.sort( sortOrder ); if ( hasDuplicate ) { while ( (elem = results[i++]) ) { if ( elem === results[ i ] ) { j = duplicates.push( i ); } } while ( j-- ) { results.splice( duplicates[ j ], 1 ); } } // Clear input after sorting to release objects // See https://github.com/jquery/sizzle/pull/225 sortInput = null; return results; }; /** * Utility function for retrieving the text value of an array of DOM nodes * @param {Array|Element} elem */ getText = Sizzle.getText = function( elem ) { var node, ret = "", i = 0, nodeType = elem.nodeType; if ( !nodeType ) { // If no nodeType, this is expected to be an array while ( (node = elem[i++]) ) { // Do not traverse comment nodes ret += getText( node ); } } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { // Use textContent for elements // innerText usage removed for consistency of new lines (jQuery #11153) if ( typeof elem.textContent === "string" ) { return elem.textContent; } else { // Traverse its children for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { ret += getText( elem ); } } } else if ( nodeType === 3 || nodeType === 4 ) { return elem.nodeValue; } // Do not include comment or processing instruction nodes return ret; }; Expr = Sizzle.selectors = { // Can be adjusted by the user cacheLength: 50, createPseudo: markFunction, match: matchExpr, attrHandle: {}, find: {}, relative: { ">": { dir: "parentNode", first: true }, " ": { dir: "parentNode" }, "+": { dir: "previousSibling", first: true }, "~": { dir: "previousSibling" } }, preFilter: { "ATTR": function( match ) { match[1] = match[1].replace( runescape, funescape ); // Move the given value to match[3] whether quoted or unquoted match[3] = ( match[3] || match[4] || match[5] || "" ).replace( runescape, funescape ); if ( match[2] === "~=" ) { match[3] = " " + match[3] + " "; } return match.slice( 0, 4 ); }, "CHILD": function( match ) { /* matches from matchExpr["CHILD"] 1 type (only|nth|...) 2 what (child|of-type) 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) 4 xn-component of xn+y argument ([+-]?\d*n|) 5 sign of xn-component 6 x of xn-component 7 sign of y-component 8 y of y-component */ match[1] = match[1].toLowerCase(); if ( match[1].slice( 0, 3 ) === "nth" ) { // nth-* requires argument if ( !match[3] ) { Sizzle.error( match[0] ); } // numeric x and y parameters for Expr.filter.CHILD // remember that false/true cast respectively to 0/1 match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) ); match[5] = +( ( match[7] + match[8] ) || match[3] === "odd" ); // other types prohibit arguments } else if ( match[3] ) { Sizzle.error( match[0] ); } return match; }, "PSEUDO": function( match ) { var excess, unquoted = !match[6] && match[2]; if ( matchExpr["CHILD"].test( match[0] ) ) { return null; } // Accept quoted arguments as-is if ( match[3] ) { match[2] = match[4] || match[5] || ""; // Strip excess characters from unquoted arguments } else if ( unquoted && rpseudo.test( unquoted ) && // Get excess from tokenize (recursively) (excess = tokenize( unquoted, true )) && // advance to the next closing parenthesis (excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) { // excess is a negative index match[0] = match[0].slice( 0, excess ); match[2] = unquoted.slice( 0, excess ); } // Return only captures needed by the pseudo filter method (type and argument) return match.slice( 0, 3 ); } }, filter: { "TAG": function( nodeNameSelector ) { var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); return nodeNameSelector === "*" ? function() { return true; } : function( elem ) { return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; }; }, "CLASS": function( className ) { var pattern = classCache[ className + " " ]; return pattern || (pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) && classCache( className, function( elem ) { return pattern.test( typeof elem.className === "string" && elem.className || typeof elem.getAttribute !== "undefined" && elem.getAttribute("class") || "" ); }); }, "ATTR": function( name, operator, check ) { return function( elem ) { var result = Sizzle.attr( elem, name ); if ( result == null ) { return operator === "!="; } if ( !operator ) { return true; } result += ""; return operator === "=" ? result === check : operator === "!=" ? result !== check : operator === "^=" ? check && result.indexOf( check ) === 0 : operator === "*=" ? check && result.indexOf( check ) > -1 : operator === "$=" ? check && result.slice( -check.length ) === check : operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : false; }; }, "CHILD": function( type, what, argument, first, last ) { var simple = type.slice( 0, 3 ) !== "nth", forward = type.slice( -4 ) !== "last", ofType = what === "of-type"; return first === 1 && last === 0 ? // Shortcut for :nth-*(n) function( elem ) { return !!elem.parentNode; } : function( elem, context, xml ) { var cache, uniqueCache, outerCache, node, nodeIndex, start, dir = simple !== forward ? "nextSibling" : "previousSibling", parent = elem.parentNode, name = ofType && elem.nodeName.toLowerCase(), useCache = !xml && !ofType, diff = false; if ( parent ) { // :(first|last|only)-(child|of-type) if ( simple ) { while ( dir ) { node = elem; while ( (node = node[ dir ]) ) { if ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) { return false; } } // Reverse direction for :only-* (if we haven't yet done so) start = dir = type === "only" && !start && "nextSibling"; } return true; } start = [ forward ? parent.firstChild : parent.lastChild ]; // non-xml :nth-child(...) stores cache data on `parent` if ( forward && useCache ) { // Seek `elem` from a previously-cached index // ...in a gzip-friendly way node = parent; outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); cache = uniqueCache[ type ] || []; nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; diff = nodeIndex && cache[ 2 ]; node = nodeIndex && parent.childNodes[ nodeIndex ]; while ( (node = ++nodeIndex && node && node[ dir ] || // Fallback to seeking `elem` from the start (diff = nodeIndex = 0) || start.pop()) ) { // When found, cache indexes on `parent` and break if ( node.nodeType === 1 && ++diff && node === elem ) { uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; break; } } } else { // Use previously-cached element index if available if ( useCache ) { // ...in a gzip-friendly way node = elem; outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); cache = uniqueCache[ type ] || []; nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; diff = nodeIndex; } // xml :nth-child(...) // or :nth-last-child(...) or :nth(-last)?-of-type(...) if ( diff === false ) { // Use the same loop as above to seek `elem` from the start while ( (node = ++nodeIndex && node && node[ dir ] || (diff = nodeIndex = 0) || start.pop()) ) { if ( ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) && ++diff ) { // Cache the index of each encountered element if ( useCache ) { outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); uniqueCache[ type ] = [ dirruns, diff ]; } if ( node === elem ) { break; } } } } } // Incorporate the offset, then check against cycle size diff -= last; return diff === first || ( diff % first === 0 && diff / first >= 0 ); } }; }, "PSEUDO": function( pseudo, argument ) { // pseudo-class names are case-insensitive // http://www.w3.org/TR/selectors/#pseudo-classes // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters // Remember that setFilters inherits from pseudos var args, fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || Sizzle.error( "unsupported pseudo: " + pseudo ); // The user may use createPseudo to indicate that // arguments are needed to create the filter function // just as Sizzle does if ( fn[ expando ] ) { return fn( argument ); } // But maintain support for old signatures if ( fn.length > 1 ) { args = [ pseudo, pseudo, "", argument ]; return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? markFunction(function( seed, matches ) { var idx, matched = fn( seed, argument ), i = matched.length; while ( i-- ) { idx = indexOf( seed, matched[i] ); seed[ idx ] = !( matches[ idx ] = matched[i] ); } }) : function( elem ) { return fn( elem, 0, args ); }; } return fn; } }, pseudos: { // Potentially complex pseudos "not": markFunction(function( selector ) { // Trim the selector passed to compile // to avoid treating leading and trailing // spaces as combinators var input = [], results = [], matcher = compile( selector.replace( rtrim, "$1" ) ); return matcher[ expando ] ? markFunction(function( seed, matches, context, xml ) { var elem, unmatched = matcher( seed, null, xml, [] ), i = seed.length; // Match elements unmatched by `matcher` while ( i-- ) { if ( (elem = unmatched[i]) ) { seed[i] = !(matches[i] = elem); } } }) : function( elem, context, xml ) { input[0] = elem; matcher( input, null, xml, results ); // Don't keep the element (issue #299) input[0] = null; return !results.pop(); }; }), "has": markFunction(function( selector ) { return function( elem ) { return Sizzle( selector, elem ).length > 0; }; }), "contains": markFunction(function( text ) { text = text.replace( runescape, funescape ); return function( elem ) { return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; }; }), // "Whether an element is represented by a :lang() selector // is based solely on the element's language value // being equal to the identifier C, // or beginning with the identifier C immediately followed by "-". // The matching of C against the element's language value is performed case-insensitively. // The identifier C does not have to be a valid language name." // http://www.w3.org/TR/selectors/#lang-pseudo "lang": markFunction( function( lang ) { // lang value must be a valid identifier if ( !ridentifier.test(lang || "") ) { Sizzle.error( "unsupported lang: " + lang ); } lang = lang.replace( runescape, funescape ).toLowerCase(); return function( elem ) { var elemLang; do { if ( (elemLang = documentIsHTML ? elem.lang : elem.getAttribute("xml:lang") || elem.getAttribute("lang")) ) { elemLang = elemLang.toLowerCase(); return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; } } while ( (elem = elem.parentNode) && elem.nodeType === 1 ); return false; }; }), // Miscellaneous "target": function( elem ) { var hash = window.location && window.location.hash; return hash && hash.slice( 1 ) === elem.id; }, "root": function( elem ) { return elem === docElem; }, "focus": function( elem ) { return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex); }, // Boolean properties "enabled": createDisabledPseudo( false ), "disabled": createDisabledPseudo( true ), "checked": function( elem ) { // In CSS3, :checked should return both checked and selected elements // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked var nodeName = elem.nodeName.toLowerCase(); return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected); }, "selected": function( elem ) { // Accessing this property makes selected-by-default // options in Safari work properly if ( elem.parentNode ) { elem.parentNode.selectedIndex; } return elem.selected === true; }, // Contents "empty": function( elem ) { // http://www.w3.org/TR/selectors/#empty-pseudo // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), // but not by others (comment: 8; processing instruction: 7; etc.) // nodeType < 6 works because attributes (2) do not appear as children for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { if ( elem.nodeType < 6 ) { return false; } } return true; }, "parent": function( elem ) { return !Expr.pseudos["empty"]( elem ); }, // Element/input types "header": function( elem ) { return rheader.test( elem.nodeName ); }, "input": function( elem ) { return rinputs.test( elem.nodeName ); }, "button": function( elem ) { var name = elem.nodeName.toLowerCase(); return name === "input" && elem.type === "button" || name === "button"; }, "text": function( elem ) { var attr; return elem.nodeName.toLowerCase() === "input" && elem.type === "text" && // Support: IE<8 // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" ( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === "text" ); }, // Position-in-collection "first": createPositionalPseudo(function() { return [ 0 ]; }), "last": createPositionalPseudo(function( matchIndexes, length ) { return [ length - 1 ]; }), "eq": createPositionalPseudo(function( matchIndexes, length, argument ) { return [ argument < 0 ? argument + length : argument ]; }), "even": createPositionalPseudo(function( matchIndexes, length ) { var i = 0; for ( ; i < length; i += 2 ) { matchIndexes.push( i ); } return matchIndexes; }), "odd": createPositionalPseudo(function( matchIndexes, length ) { var i = 1; for ( ; i < length; i += 2 ) { matchIndexes.push( i ); } return matchIndexes; }), "lt": createPositionalPseudo(function( matchIndexes, length, argument ) { var i = argument < 0 ? argument + length : argument > length ? length : argument; for ( ; --i >= 0; ) { matchIndexes.push( i ); } return matchIndexes; }), "gt": createPositionalPseudo(function( matchIndexes, length, argument ) { var i = argument < 0 ? argument + length : argument; for ( ; ++i < length; ) { matchIndexes.push( i ); } return matchIndexes; }) } }; Expr.pseudos["nth"] = Expr.pseudos["eq"]; // Add button/input type pseudos for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { Expr.pseudos[ i ] = createInputPseudo( i ); } for ( i in { submit: true, reset: true } ) { Expr.pseudos[ i ] = createButtonPseudo( i ); } // Easy API for creating new setFilters function setFilters() {} setFilters.prototype = Expr.filters = Expr.pseudos; Expr.setFilters = new setFilters(); tokenize = Sizzle.tokenize = function( selector, parseOnly ) { var matched, match, tokens, type, soFar, groups, preFilters, cached = tokenCache[ selector + " " ]; if ( cached ) { return parseOnly ? 0 : cached.slice( 0 ); } soFar = selector; groups = []; preFilters = Expr.preFilter; while ( soFar ) { // Comma and first run if ( !matched || (match = rcomma.exec( soFar )) ) { if ( match ) { // Don't consume trailing commas as valid soFar = soFar.slice( match[0].length ) || soFar; } groups.push( (tokens = []) ); } matched = false; // Combinators if ( (match = rcombinators.exec( soFar )) ) { matched = match.shift(); tokens.push({ value: matched, // Cast descendant combinators to space type: match[0].replace( rtrim, " " ) }); soFar = soFar.slice( matched.length ); } // Filters for ( type in Expr.filter ) { if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] || (match = preFilters[ type ]( match ))) ) { matched = match.shift(); tokens.push({ value: matched, type: type, matches: match }); soFar = soFar.slice( matched.length ); } } if ( !matched ) { break; } } // Return the length of the invalid excess // if we're just parsing // Otherwise, throw an error or return tokens return parseOnly ? soFar.length : soFar ? Sizzle.error( selector ) : // Cache the tokens tokenCache( selector, groups ).slice( 0 ); }; function toSelector( tokens ) { var i = 0, len = tokens.length, selector = ""; for ( ; i < len; i++ ) { selector += tokens[i].value; } return selector; } function addCombinator( matcher, combinator, base ) { var dir = combinator.dir, skip = combinator.next, key = skip || dir, checkNonElements = base && key === "parentNode", doneName = done++; return combinator.first ? // Check against closest ancestor/preceding element function( elem, context, xml ) { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { return matcher( elem, context, xml ); } } return false; } : // Check against all ancestor/preceding elements function( elem, context, xml ) { var oldCache, uniqueCache, outerCache, newCache = [ dirruns, doneName ]; // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching if ( xml ) { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { if ( matcher( elem, context, xml ) ) { return true; } } } } else { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { outerCache = elem[ expando ] || (elem[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ elem.uniqueID ] || (outerCache[ elem.uniqueID ] = {}); if ( skip && skip === elem.nodeName.toLowerCase() ) { elem = elem[ dir ] || elem; } else if ( (oldCache = uniqueCache[ key ]) && oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { // Assign to newCache so results back-propagate to previous elements return (newCache[ 2 ] = oldCache[ 2 ]); } else { // Reuse newcache so results back-propagate to previous elements uniqueCache[ key ] = newCache; // A match means we're done; a fail means we have to keep checking if ( (newCache[ 2 ] = matcher( elem, context, xml )) ) { return true; } } } } } return false; }; } function elementMatcher( matchers ) { return matchers.length > 1 ? function( elem, context, xml ) { var i = matchers.length; while ( i-- ) { if ( !matchers[i]( elem, context, xml ) ) { return false; } } return true; } : matchers[0]; } function multipleContexts( selector, contexts, results ) { var i = 0, len = contexts.length; for ( ; i < len; i++ ) { Sizzle( selector, contexts[i], results ); } return results; } function condense( unmatched, map, filter, context, xml ) { var elem, newUnmatched = [], i = 0, len = unmatched.length, mapped = map != null; for ( ; i < len; i++ ) { if ( (elem = unmatched[i]) ) { if ( !filter || filter( elem, context, xml ) ) { newUnmatched.push( elem ); if ( mapped ) { map.push( i ); } } } } return newUnmatched; } function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { if ( postFilter && !postFilter[ expando ] ) { postFilter = setMatcher( postFilter ); } if ( postFinder && !postFinder[ expando ] ) { postFinder = setMatcher( postFinder, postSelector ); } return markFunction(function( seed, results, context, xml ) { var temp, i, elem, preMap = [], postMap = [], preexisting = results.length, // Get initial elements from seed or context elems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ), // Prefilter to get matcher input, preserving a map for seed-results synchronization matcherIn = preFilter && ( seed || !selector ) ? condense( elems, preMap, preFilter, context, xml ) : elems, matcherOut = matcher ? // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, postFinder || ( seed ? preFilter : preexisting || postFilter ) ? // ...intermediate processing is necessary [] : // ...otherwise use results directly results : matcherIn; // Find primary matches if ( matcher ) { matcher( matcherIn, matcherOut, context, xml ); } // Apply postFilter if ( postFilter ) { temp = condense( matcherOut, postMap ); postFilter( temp, [], context, xml ); // Un-match failing elements by moving them back to matcherIn i = temp.length; while ( i-- ) { if ( (elem = temp[i]) ) { matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem); } } } if ( seed ) { if ( postFinder || preFilter ) { if ( postFinder ) { // Get the final matcherOut by condensing this intermediate into postFinder contexts temp = []; i = matcherOut.length; while ( i-- ) { if ( (elem = matcherOut[i]) ) { // Restore matcherIn since elem is not yet a final match temp.push( (matcherIn[i] = elem) ); } } postFinder( null, (matcherOut = []), temp, xml ); } // Move matched elements from seed to results to keep them synchronized i = matcherOut.length; while ( i-- ) { if ( (elem = matcherOut[i]) && (temp = postFinder ? indexOf( seed, elem ) : preMap[i]) > -1 ) { seed[temp] = !(results[temp] = elem); } } } // Add elements to results, through postFinder if defined } else { matcherOut = condense( matcherOut === results ? matcherOut.splice( preexisting, matcherOut.length ) : matcherOut ); if ( postFinder ) { postFinder( null, results, matcherOut, xml ); } else { push.apply( results, matcherOut ); } } }); } function matcherFromTokens( tokens ) { var checkContext, matcher, j, len = tokens.length, leadingRelative = Expr.relative[ tokens[0].type ], implicitRelative = leadingRelative || Expr.relative[" "], i = leadingRelative ? 1 : 0, // The foundational matcher ensures that elements are reachable from top-level context(s) matchContext = addCombinator( function( elem ) { return elem === checkContext; }, implicitRelative, true ), matchAnyContext = addCombinator( function( elem ) { return indexOf( checkContext, elem ) > -1; }, implicitRelative, true ), matchers = [ function( elem, context, xml ) { var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( (checkContext = context).nodeType ? matchContext( elem, context, xml ) : matchAnyContext( elem, context, xml ) ); // Avoid hanging onto element (issue #299) checkContext = null; return ret; } ]; for ( ; i < len; i++ ) { if ( (matcher = Expr.relative[ tokens[i].type ]) ) { matchers = [ addCombinator(elementMatcher( matchers ), matcher) ]; } else { matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches ); // Return special upon seeing a positional matcher if ( matcher[ expando ] ) { // Find the next relative operator (if any) for proper handling j = ++i; for ( ; j < len; j++ ) { if ( Expr.relative[ tokens[j].type ] ) { break; } } return setMatcher( i > 1 && elementMatcher( matchers ), i > 1 && toSelector( // If the preceding token was a descendant combinator, insert an implicit any-element `*` tokens.slice( 0, i - 1 ).concat({ value: tokens[ i - 2 ].type === " " ? "*" : "" }) ).replace( rtrim, "$1" ), matcher, i < j && matcherFromTokens( tokens.slice( i, j ) ), j < len && matcherFromTokens( (tokens = tokens.slice( j )) ), j < len && toSelector( tokens ) ); } matchers.push( matcher ); } } return elementMatcher( matchers ); } function matcherFromGroupMatchers( elementMatchers, setMatchers ) { var bySet = setMatchers.length > 0, byElement = elementMatchers.length > 0, superMatcher = function( seed, context, xml, results, outermost ) { var elem, j, matcher, matchedCount = 0, i = "0", unmatched = seed && [], setMatched = [], contextBackup = outermostContext, // We must always have either seed elements or outermost context elems = seed || byElement && Expr.find["TAG"]( "*", outermost ), // Use integer dirruns iff this is the outermost matcher dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1), len = elems.length; if ( outermost ) { outermostContext = context === document || context || outermost; } // Add elements passing elementMatchers directly to results // Support: IE<9, Safari // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id for ( ; i !== len && (elem = elems[i]) != null; i++ ) { if ( byElement && elem ) { j = 0; if ( !context && elem.ownerDocument !== document ) { setDocument( elem ); xml = !documentIsHTML; } while ( (matcher = elementMatchers[j++]) ) { if ( matcher( elem, context || document, xml) ) { results.push( elem ); break; } } if ( outermost ) { dirruns = dirrunsUnique; } } // Track unmatched elements for set filters if ( bySet ) { // They will have gone through all possible matchers if ( (elem = !matcher && elem) ) { matchedCount--; } // Lengthen the array for every element, matched or not if ( seed ) { unmatched.push( elem ); } } } // `i` is now the count of elements visited above, and adding it to `matchedCount` // makes the latter nonnegative. matchedCount += i; // Apply set filters to unmatched elements // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` // equals `i`), unless we didn't visit _any_ elements in the above loop because we have // no element matchers and no seed. // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that // case, which will result in a "00" `matchedCount` that differs from `i` but is also // numerically zero. if ( bySet && i !== matchedCount ) { j = 0; while ( (matcher = setMatchers[j++]) ) { matcher( unmatched, setMatched, context, xml ); } if ( seed ) { // Reintegrate element matches to eliminate the need for sorting if ( matchedCount > 0 ) { while ( i-- ) { if ( !(unmatched[i] || setMatched[i]) ) { setMatched[i] = pop.call( results ); } } } // Discard index placeholder values to get only actual matches setMatched = condense( setMatched ); } // Add matches to results push.apply( results, setMatched ); // Seedless set matches succeeding multiple successful matchers stipulate sorting if ( outermost && !seed && setMatched.length > 0 && ( matchedCount + setMatchers.length ) > 1 ) { Sizzle.uniqueSort( results ); } } // Override manipulation of globals by nested matchers if ( outermost ) { dirruns = dirrunsUnique; outermostContext = contextBackup; } return unmatched; }; return bySet ? markFunction( superMatcher ) : superMatcher; } compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { var i, setMatchers = [], elementMatchers = [], cached = compilerCache[ selector + " " ]; if ( !cached ) { // Generate a function of recursive functions that can be used to check each element if ( !match ) { match = tokenize( selector ); } i = match.length; while ( i-- ) { cached = matcherFromTokens( match[i] ); if ( cached[ expando ] ) { setMatchers.push( cached ); } else { elementMatchers.push( cached ); } } // Cache the compiled function cached = compilerCache( selector, matcherFromGroupMatchers( elementMatchers, setMatchers ) ); // Save selector and tokenization cached.selector = selector; } return cached; }; /** * A low-level selection function that works with Sizzle's compiled * selector functions * @param {String|Function} selector A selector or a pre-compiled * selector function built with Sizzle.compile * @param {Element} context * @param {Array} [results] * @param {Array} [seed] A set of elements to match against */ select = Sizzle.select = function( selector, context, results, seed ) { var i, tokens, token, type, find, compiled = typeof selector === "function" && selector, match = !seed && tokenize( (selector = compiled.selector || selector) ); results = results || []; // Try to minimize operations if there is only one selector in the list and no seed // (the latter of which guarantees us context) if ( match.length === 1 ) { // Reduce context if the leading compound selector is an ID tokens = match[0] = match[0].slice( 0 ); if ( tokens.length > 2 && (token = tokens[0]).type === "ID" && context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[1].type ] ) { context = ( Expr.find["ID"]( token.matches[0].replace(runescape, funescape), context ) || [] )[0]; if ( !context ) { return results; // Precompiled matchers will still verify ancestry, so step up a level } else if ( compiled ) { context = context.parentNode; } selector = selector.slice( tokens.shift().value.length ); } // Fetch a seed set for right-to-left matching i = matchExpr["needsContext"].test( selector ) ? 0 : tokens.length; while ( i-- ) { token = tokens[i]; // Abort if we hit a combinator if ( Expr.relative[ (type = token.type) ] ) { break; } if ( (find = Expr.find[ type ]) ) { // Search, expanding context for leading sibling combinators if ( (seed = find( token.matches[0].replace( runescape, funescape ), rsibling.test( tokens[0].type ) && testContext( context.parentNode ) || context )) ) { // If seed is empty or no tokens remain, we can return early tokens.splice( i, 1 ); selector = seed.length && toSelector( tokens ); if ( !selector ) { push.apply( results, seed ); return results; } break; } } } } // Compile and execute a filtering function if one is not provided // Provide `match` to avoid retokenization if we modified the selector above ( compiled || compile( selector, match ) )( seed, context, !documentIsHTML, results, !context || rsibling.test( selector ) && testContext( context.parentNode ) || context ); return results; }; // One-time assignments // Sort stability support.sortStable = expando.split("").sort( sortOrder ).join("") === expando; // Support: Chrome 14-35+ // Always assume duplicates if they aren't passed to the comparison function support.detectDuplicates = !!hasDuplicate; // Initialize against the default document setDocument(); // Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) // Detached nodes confoundingly follow *each other* support.sortDetached = assert(function( el ) { // Should return 1, but returns 4 (following) return el.compareDocumentPosition( document.createElement("fieldset") ) & 1; }); // Support: IE<8 // Prevent attribute/property "interpolation" // https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx if ( !assert(function( el ) { el.innerHTML = ""; return el.firstChild.getAttribute("href") === "#" ; }) ) { addHandle( "type|href|height|width", function( elem, name, isXML ) { if ( !isXML ) { return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); } }); } // Support: IE<9 // Use defaultValue in place of getAttribute("value") if ( !support.attributes || !assert(function( el ) { el.innerHTML = ""; el.firstChild.setAttribute( "value", "" ); return el.firstChild.getAttribute( "value" ) === ""; }) ) { addHandle( "value", function( elem, name, isXML ) { if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { return elem.defaultValue; } }); } // Support: IE<9 // Use getAttributeNode to fetch booleans when getAttribute lies if ( !assert(function( el ) { return el.getAttribute("disabled") == null; }) ) { addHandle( booleans, function( elem, name, isXML ) { var val; if ( !isXML ) { return elem[ name ] === true ? name.toLowerCase() : (val = elem.getAttributeNode( name )) && val.specified ? val.value : null; } }); } return Sizzle; })( window ); jQuery.find = Sizzle; jQuery.expr = Sizzle.selectors; // Deprecated jQuery.expr[ ":" ] = jQuery.expr.pseudos; jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; jQuery.text = Sizzle.getText; jQuery.isXMLDoc = Sizzle.isXML; jQuery.contains = Sizzle.contains; jQuery.escapeSelector = Sizzle.escape; var dir = function( elem, dir, until ) { var matched = [], truncate = until !== undefined; while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { if ( elem.nodeType === 1 ) { if ( truncate && jQuery( elem ).is( until ) ) { break; } matched.push( elem ); } } return matched; }; var siblings = function( n, elem ) { var matched = []; for ( ; n; n = n.nextSibling ) { if ( n.nodeType === 1 && n !== elem ) { matched.push( n ); } } return matched; }; var rneedsContext = jQuery.expr.match.needsContext; function nodeName( elem, name ) { return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); }; var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); // Implement the identical functionality for filter and not function winnow( elements, qualifier, not ) { if ( isFunction( qualifier ) ) { return jQuery.grep( elements, function( elem, i ) { return !!qualifier.call( elem, i, elem ) !== not; } ); } // Single element if ( qualifier.nodeType ) { return jQuery.grep( elements, function( elem ) { return ( elem === qualifier ) !== not; } ); } // Arraylike of elements (jQuery, arguments, Array) if ( typeof qualifier !== "string" ) { return jQuery.grep( elements, function( elem ) { return ( indexOf.call( qualifier, elem ) > -1 ) !== not; } ); } // Filtered directly for both simple and complex selectors return jQuery.filter( qualifier, elements, not ); } jQuery.filter = function( expr, elems, not ) { var elem = elems[ 0 ]; if ( not ) { expr = ":not(" + expr + ")"; } if ( elems.length === 1 && elem.nodeType === 1 ) { return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; } return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { return elem.nodeType === 1; } ) ); }; jQuery.fn.extend( { find: function( selector ) { var i, ret, len = this.length, self = this; if ( typeof selector !== "string" ) { return this.pushStack( jQuery( selector ).filter( function() { for ( i = 0; i < len; i++ ) { if ( jQuery.contains( self[ i ], this ) ) { return true; } } } ) ); } ret = this.pushStack( [] ); for ( i = 0; i < len; i++ ) { jQuery.find( selector, self[ i ], ret ); } return len > 1 ? jQuery.uniqueSort( ret ) : ret; }, filter: function( selector ) { return this.pushStack( winnow( this, selector || [], false ) ); }, not: function( selector ) { return this.pushStack( winnow( this, selector || [], true ) ); }, is: function( selector ) { return !!winnow( this, // If this is a positional/relative selector, check membership in the returned set // so $("p:first").is("p:last") won't return true for a doc with two "p". typeof selector === "string" && rneedsContext.test( selector ) ? jQuery( selector ) : selector || [], false ).length; } } ); // Initialize a jQuery object // A central reference to the root jQuery(document) var rootjQuery, // A simple way to check for HTML strings // Prioritize #id over to avoid XSS via location.hash (#9521) // Strict HTML recognition (#11290: must start with <) // Shortcut simple #id case for speed rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, init = jQuery.fn.init = function( selector, context, root ) { var match, elem; // HANDLE: $(""), $(null), $(undefined), $(false) if ( !selector ) { return this; } // Method init() accepts an alternate rootjQuery // so migrate can support jQuery.sub (gh-2101) root = root || rootjQuery; // Handle HTML strings if ( typeof selector === "string" ) { if ( selector[ 0 ] === "<" && selector[ selector.length - 1 ] === ">" && selector.length >= 3 ) { // Assume that strings that start and end with <> are HTML and skip the regex check match = [ null, selector, null ]; } else { match = rquickExpr.exec( selector ); } // Match html or make sure no context is specified for #id if ( match && ( match[ 1 ] || !context ) ) { // HANDLE: $(html) -> $(array) if ( match[ 1 ] ) { context = context instanceof jQuery ? context[ 0 ] : context; // Option to run scripts is true for back-compat // Intentionally let the error be thrown if parseHTML is not present jQuery.merge( this, jQuery.parseHTML( match[ 1 ], context && context.nodeType ? context.ownerDocument || context : document, true ) ); // HANDLE: $(html, props) if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { for ( match in context ) { // Properties of context are called as methods if possible if ( isFunction( this[ match ] ) ) { this[ match ]( context[ match ] ); // ...and otherwise set as attributes } else { this.attr( match, context[ match ] ); } } } return this; // HANDLE: $(#id) } else { elem = document.getElementById( match[ 2 ] ); if ( elem ) { // Inject the element directly into the jQuery object this[ 0 ] = elem; this.length = 1; } return this; } // HANDLE: $(expr, $(...)) } else if ( !context || context.jquery ) { return ( context || root ).find( selector ); // HANDLE: $(expr, context) // (which is just equivalent to: $(context).find(expr) } else { return this.constructor( context ).find( selector ); } // HANDLE: $(DOMElement) } else if ( selector.nodeType ) { this[ 0 ] = selector; this.length = 1; return this; // HANDLE: $(function) // Shortcut for document ready } else if ( isFunction( selector ) ) { return root.ready !== undefined ? root.ready( selector ) : // Execute immediately if ready is not present selector( jQuery ); } return jQuery.makeArray( selector, this ); }; // Give the init function the jQuery prototype for later instantiation init.prototype = jQuery.fn; // Initialize central reference rootjQuery = jQuery( document ); var rparentsprev = /^(?:parents|prev(?:Until|All))/, // Methods guaranteed to produce a unique set when starting from a unique set guaranteedUnique = { children: true, contents: true, next: true, prev: true }; jQuery.fn.extend( { has: function( target ) { var targets = jQuery( target, this ), l = targets.length; return this.filter( function() { var i = 0; for ( ; i < l; i++ ) { if ( jQuery.contains( this, targets[ i ] ) ) { return true; } } } ); }, closest: function( selectors, context ) { var cur, i = 0, l = this.length, matched = [], targets = typeof selectors !== "string" && jQuery( selectors ); // Positional selectors never match, since there's no _selection_ context if ( !rneedsContext.test( selectors ) ) { for ( ; i < l; i++ ) { for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { // Always skip document fragments if ( cur.nodeType < 11 && ( targets ? targets.index( cur ) > -1 : // Don't pass non-elements to Sizzle cur.nodeType === 1 && jQuery.find.matchesSelector( cur, selectors ) ) ) { matched.push( cur ); break; } } } } return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); }, // Determine the position of an element within the set index: function( elem ) { // No argument, return index in parent if ( !elem ) { return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; } // Index in selector if ( typeof elem === "string" ) { return indexOf.call( jQuery( elem ), this[ 0 ] ); } // Locate the position of the desired element return indexOf.call( this, // If it receives a jQuery object, the first element is used elem.jquery ? elem[ 0 ] : elem ); }, add: function( selector, context ) { return this.pushStack( jQuery.uniqueSort( jQuery.merge( this.get(), jQuery( selector, context ) ) ) ); }, addBack: function( selector ) { return this.add( selector == null ? this.prevObject : this.prevObject.filter( selector ) ); } } ); function sibling( cur, dir ) { while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} return cur; } jQuery.each( { parent: function( elem ) { var parent = elem.parentNode; return parent && parent.nodeType !== 11 ? parent : null; }, parents: function( elem ) { return dir( elem, "parentNode" ); }, parentsUntil: function( elem, i, until ) { return dir( elem, "parentNode", until ); }, next: function( elem ) { return sibling( elem, "nextSibling" ); }, prev: function( elem ) { return sibling( elem, "previousSibling" ); }, nextAll: function( elem ) { return dir( elem, "nextSibling" ); }, prevAll: function( elem ) { return dir( elem, "previousSibling" ); }, nextUntil: function( elem, i, until ) { return dir( elem, "nextSibling", until ); }, prevUntil: function( elem, i, until ) { return dir( elem, "previousSibling", until ); }, siblings: function( elem ) { return siblings( ( elem.parentNode || {} ).firstChild, elem ); }, children: function( elem ) { return siblings( elem.firstChild ); }, contents: function( elem ) { if ( typeof elem.contentDocument !== "undefined" ) { return elem.contentDocument; } // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only // Treat the template element as a regular one in browsers that // don't support it. if ( nodeName( elem, "template" ) ) { elem = elem.content || elem; } return jQuery.merge( [], elem.childNodes ); } }, function( name, fn ) { jQuery.fn[ name ] = function( until, selector ) { var matched = jQuery.map( this, fn, until ); if ( name.slice( -5 ) !== "Until" ) { selector = until; } if ( selector && typeof selector === "string" ) { matched = jQuery.filter( selector, matched ); } if ( this.length > 1 ) { // Remove duplicates if ( !guaranteedUnique[ name ] ) { jQuery.uniqueSort( matched ); } // Reverse order for parents* and prev-derivatives if ( rparentsprev.test( name ) ) { matched.reverse(); } } return this.pushStack( matched ); }; } ); var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); // Convert String-formatted options into Object-formatted ones function createOptions( options ) { var object = {}; jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { object[ flag ] = true; } ); return object; } /* * Create a callback list using the following parameters: * * options: an optional list of space-separated options that will change how * the callback list behaves or a more traditional option object * * By default a callback list will act like an event callback list and can be * "fired" multiple times. * * Possible options: * * once: will ensure the callback list can only be fired once (like a Deferred) * * memory: will keep track of previous values and will call any callback added * after the list has been fired right away with the latest "memorized" * values (like a Deferred) * * unique: will ensure a callback can only be added once (no duplicate in the list) * * stopOnFalse: interrupt callings when a callback returns false * */ jQuery.Callbacks = function( options ) { // Convert options from String-formatted to Object-formatted if needed // (we check in cache first) options = typeof options === "string" ? createOptions( options ) : jQuery.extend( {}, options ); var // Flag to know if list is currently firing firing, // Last fire value for non-forgettable lists memory, // Flag to know if list was already fired fired, // Flag to prevent firing locked, // Actual callback list list = [], // Queue of execution data for repeatable lists queue = [], // Index of currently firing callback (modified by add/remove as needed) firingIndex = -1, // Fire callbacks fire = function() { // Enforce single-firing locked = locked || options.once; // Execute callbacks for all pending executions, // respecting firingIndex overrides and runtime changes fired = firing = true; for ( ; queue.length; firingIndex = -1 ) { memory = queue.shift(); while ( ++firingIndex < list.length ) { // Run callback and check for early termination if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && options.stopOnFalse ) { // Jump to end and forget the data so .add doesn't re-fire firingIndex = list.length; memory = false; } } } // Forget the data if we're done with it if ( !options.memory ) { memory = false; } firing = false; // Clean up if we're done firing for good if ( locked ) { // Keep an empty list if we have data for future add calls if ( memory ) { list = []; // Otherwise, this object is spent } else { list = ""; } } }, // Actual Callbacks object self = { // Add a callback or a collection of callbacks to the list add: function() { if ( list ) { // If we have memory from a past run, we should fire after adding if ( memory && !firing ) { firingIndex = list.length - 1; queue.push( memory ); } ( function add( args ) { jQuery.each( args, function( _, arg ) { if ( isFunction( arg ) ) { if ( !options.unique || !self.has( arg ) ) { list.push( arg ); } } else if ( arg && arg.length && toType( arg ) !== "string" ) { // Inspect recursively add( arg ); } } ); } )( arguments ); if ( memory && !firing ) { fire(); } } return this; }, // Remove a callback from the list remove: function() { jQuery.each( arguments, function( _, arg ) { var index; while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { list.splice( index, 1 ); // Handle firing indexes if ( index <= firingIndex ) { firingIndex--; } } } ); return this; }, // Check if a given callback is in the list. // If no argument is given, return whether or not list has callbacks attached. has: function( fn ) { return fn ? jQuery.inArray( fn, list ) > -1 : list.length > 0; }, // Remove all callbacks from the list empty: function() { if ( list ) { list = []; } return this; }, // Disable .fire and .add // Abort any current/pending executions // Clear all callbacks and values disable: function() { locked = queue = []; list = memory = ""; return this; }, disabled: function() { return !list; }, // Disable .fire // Also disable .add unless we have memory (since it would have no effect) // Abort any pending executions lock: function() { locked = queue = []; if ( !memory && !firing ) { list = memory = ""; } return this; }, locked: function() { return !!locked; }, // Call all callbacks with the given context and arguments fireWith: function( context, args ) { if ( !locked ) { args = args || []; args = [ context, args.slice ? args.slice() : args ]; queue.push( args ); if ( !firing ) { fire(); } } return this; }, // Call all the callbacks with the given arguments fire: function() { self.fireWith( this, arguments ); return this; }, // To know if the callbacks have already been called at least once fired: function() { return !!fired; } }; return self; }; function Identity( v ) { return v; } function Thrower( ex ) { throw ex; } function adoptValue( value, resolve, reject, noValue ) { var method; try { // Check for promise aspect first to privilege synchronous behavior if ( value && isFunction( ( method = value.promise ) ) ) { method.call( value ).done( resolve ).fail( reject ); // Other thenables } else if ( value && isFunction( ( method = value.then ) ) ) { method.call( value, resolve, reject ); // Other non-thenables } else { // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: // * false: [ value ].slice( 0 ) => resolve( value ) // * true: [ value ].slice( 1 ) => resolve() resolve.apply( undefined, [ value ].slice( noValue ) ); } // For Promises/A+, convert exceptions into rejections // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in // Deferred#then to conditionally suppress rejection. } catch ( value ) { // Support: Android 4.0 only // Strict mode functions invoked without .call/.apply get global-object context reject.apply( undefined, [ value ] ); } } jQuery.extend( { Deferred: function( func ) { var tuples = [ // action, add listener, callbacks, // ... .then handlers, argument index, [final state] [ "notify", "progress", jQuery.Callbacks( "memory" ), jQuery.Callbacks( "memory" ), 2 ], [ "resolve", "done", jQuery.Callbacks( "once memory" ), jQuery.Callbacks( "once memory" ), 0, "resolved" ], [ "reject", "fail", jQuery.Callbacks( "once memory" ), jQuery.Callbacks( "once memory" ), 1, "rejected" ] ], state = "pending", promise = { state: function() { return state; }, always: function() { deferred.done( arguments ).fail( arguments ); return this; }, "catch": function( fn ) { return promise.then( null, fn ); }, // Keep pipe for back-compat pipe: function( /* fnDone, fnFail, fnProgress */ ) { var fns = arguments; return jQuery.Deferred( function( newDefer ) { jQuery.each( tuples, function( i, tuple ) { // Map tuples (progress, done, fail) to arguments (done, fail, progress) var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; // deferred.progress(function() { bind to newDefer or newDefer.notify }) // deferred.done(function() { bind to newDefer or newDefer.resolve }) // deferred.fail(function() { bind to newDefer or newDefer.reject }) deferred[ tuple[ 1 ] ]( function() { var returned = fn && fn.apply( this, arguments ); if ( returned && isFunction( returned.promise ) ) { returned.promise() .progress( newDefer.notify ) .done( newDefer.resolve ) .fail( newDefer.reject ); } else { newDefer[ tuple[ 0 ] + "With" ]( this, fn ? [ returned ] : arguments ); } } ); } ); fns = null; } ).promise(); }, then: function( onFulfilled, onRejected, onProgress ) { var maxDepth = 0; function resolve( depth, deferred, handler, special ) { return function() { var that = this, args = arguments, mightThrow = function() { var returned, then; // Support: Promises/A+ section 2.3.3.3.3 // https://promisesaplus.com/#point-59 // Ignore double-resolution attempts if ( depth < maxDepth ) { return; } returned = handler.apply( that, args ); // Support: Promises/A+ section 2.3.1 // https://promisesaplus.com/#point-48 if ( returned === deferred.promise() ) { throw new TypeError( "Thenable self-resolution" ); } // Support: Promises/A+ sections 2.3.3.1, 3.5 // https://promisesaplus.com/#point-54 // https://promisesaplus.com/#point-75 // Retrieve `then` only once then = returned && // Support: Promises/A+ section 2.3.4 // https://promisesaplus.com/#point-64 // Only check objects and functions for thenability ( typeof returned === "object" || typeof returned === "function" ) && returned.then; // Handle a returned thenable if ( isFunction( then ) ) { // Special processors (notify) just wait for resolution if ( special ) { then.call( returned, resolve( maxDepth, deferred, Identity, special ), resolve( maxDepth, deferred, Thrower, special ) ); // Normal processors (resolve) also hook into progress } else { // ...and disregard older resolution values maxDepth++; then.call( returned, resolve( maxDepth, deferred, Identity, special ), resolve( maxDepth, deferred, Thrower, special ), resolve( maxDepth, deferred, Identity, deferred.notifyWith ) ); } // Handle all other returned values } else { // Only substitute handlers pass on context // and multiple values (non-spec behavior) if ( handler !== Identity ) { that = undefined; args = [ returned ]; } // Process the value(s) // Default process is resolve ( special || deferred.resolveWith )( that, args ); } }, // Only normal processors (resolve) catch and reject exceptions process = special ? mightThrow : function() { try { mightThrow(); } catch ( e ) { if ( jQuery.Deferred.exceptionHook ) { jQuery.Deferred.exceptionHook( e, process.stackTrace ); } // Support: Promises/A+ section 2.3.3.3.4.1 // https://promisesaplus.com/#point-61 // Ignore post-resolution exceptions if ( depth + 1 >= maxDepth ) { // Only substitute handlers pass on context // and multiple values (non-spec behavior) if ( handler !== Thrower ) { that = undefined; args = [ e ]; } deferred.rejectWith( that, args ); } } }; // Support: Promises/A+ section 2.3.3.3.1 // https://promisesaplus.com/#point-57 // Re-resolve promises immediately to dodge false rejection from // subsequent errors if ( depth ) { process(); } else { // Call an optional hook to record the stack, in case of exception // since it's otherwise lost when execution goes async if ( jQuery.Deferred.getStackHook ) { process.stackTrace = jQuery.Deferred.getStackHook(); } window.setTimeout( process ); } }; } return jQuery.Deferred( function( newDefer ) { // progress_handlers.add( ... ) tuples[ 0 ][ 3 ].add( resolve( 0, newDefer, isFunction( onProgress ) ? onProgress : Identity, newDefer.notifyWith ) ); // fulfilled_handlers.add( ... ) tuples[ 1 ][ 3 ].add( resolve( 0, newDefer, isFunction( onFulfilled ) ? onFulfilled : Identity ) ); // rejected_handlers.add( ... ) tuples[ 2 ][ 3 ].add( resolve( 0, newDefer, isFunction( onRejected ) ? onRejected : Thrower ) ); } ).promise(); }, // Get a promise for this deferred // If obj is provided, the promise aspect is added to the object promise: function( obj ) { return obj != null ? jQuery.extend( obj, promise ) : promise; } }, deferred = {}; // Add list-specific methods jQuery.each( tuples, function( i, tuple ) { var list = tuple[ 2 ], stateString = tuple[ 5 ]; // promise.progress = list.add // promise.done = list.add // promise.fail = list.add promise[ tuple[ 1 ] ] = list.add; // Handle state if ( stateString ) { list.add( function() { // state = "resolved" (i.e., fulfilled) // state = "rejected" state = stateString; }, // rejected_callbacks.disable // fulfilled_callbacks.disable tuples[ 3 - i ][ 2 ].disable, // rejected_handlers.disable // fulfilled_handlers.disable tuples[ 3 - i ][ 3 ].disable, // progress_callbacks.lock tuples[ 0 ][ 2 ].lock, // progress_handlers.lock tuples[ 0 ][ 3 ].lock ); } // progress_handlers.fire // fulfilled_handlers.fire // rejected_handlers.fire list.add( tuple[ 3 ].fire ); // deferred.notify = function() { deferred.notifyWith(...) } // deferred.resolve = function() { deferred.resolveWith(...) } // deferred.reject = function() { deferred.rejectWith(...) } deferred[ tuple[ 0 ] ] = function() { deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); return this; }; // deferred.notifyWith = list.fireWith // deferred.resolveWith = list.fireWith // deferred.rejectWith = list.fireWith deferred[ tuple[ 0 ] + "With" ] = list.fireWith; } ); // Make the deferred a promise promise.promise( deferred ); // Call given func if any if ( func ) { func.call( deferred, deferred ); } // All done! return deferred; }, // Deferred helper when: function( singleValue ) { var // count of uncompleted subordinates remaining = arguments.length, // count of unprocessed arguments i = remaining, // subordinate fulfillment data resolveContexts = Array( i ), resolveValues = slice.call( arguments ), // the master Deferred master = jQuery.Deferred(), // subordinate callback factory updateFunc = function( i ) { return function( value ) { resolveContexts[ i ] = this; resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; if ( !( --remaining ) ) { master.resolveWith( resolveContexts, resolveValues ); } }; }; // Single- and empty arguments are adopted like Promise.resolve if ( remaining <= 1 ) { adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, !remaining ); // Use .then() to unwrap secondary thenables (cf. gh-3000) if ( master.state() === "pending" || isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { return master.then(); } } // Multiple arguments are aggregated like Promise.all array elements while ( i-- ) { adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); } return master.promise(); } } ); // These usually indicate a programmer mistake during development, // warn about them ASAP rather than swallowing them by default. var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; jQuery.Deferred.exceptionHook = function( error, stack ) { // Support: IE 8 - 9 only // Console exists when dev tools are open, which can happen at any time if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); } }; jQuery.readyException = function( error ) { window.setTimeout( function() { throw error; } ); }; // The deferred used on DOM ready var readyList = jQuery.Deferred(); jQuery.fn.ready = function( fn ) { readyList .then( fn ) // Wrap jQuery.readyException in a function so that the lookup // happens at the time of error handling instead of callback // registration. .catch( function( error ) { jQuery.readyException( error ); } ); return this; }; jQuery.extend( { // Is the DOM ready to be used? Set to true once it occurs. isReady: false, // A counter to track how many items to wait for before // the ready event fires. See #6781 readyWait: 1, // Handle when the DOM is ready ready: function( wait ) { // Abort if there are pending holds or we're already ready if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { return; } // Remember that the DOM is ready jQuery.isReady = true; // If a normal DOM Ready event fired, decrement, and wait if need be if ( wait !== true && --jQuery.readyWait > 0 ) { return; } // If there are functions bound, to execute readyList.resolveWith( document, [ jQuery ] ); } } ); jQuery.ready.then = readyList.then; // The ready event handler and self cleanup method function completed() { document.removeEventListener( "DOMContentLoaded", completed ); window.removeEventListener( "load", completed ); jQuery.ready(); } // Catch cases where $(document).ready() is called // after the browser event has already occurred. // Support: IE <=9 - 10 only // Older IE sometimes signals "interactive" too soon if ( document.readyState === "complete" || ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { // Handle it asynchronously to allow scripts the opportunity to delay ready window.setTimeout( jQuery.ready ); } else { // Use the handy event callback document.addEventListener( "DOMContentLoaded", completed ); // A fallback to window.onload, that will always work window.addEventListener( "load", completed ); } // Multifunctional method to get and set values of a collection // The value/s can optionally be executed if it's a function var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { var i = 0, len = elems.length, bulk = key == null; // Sets many values if ( toType( key ) === "object" ) { chainable = true; for ( i in key ) { access( elems, fn, i, key[ i ], true, emptyGet, raw ); } // Sets one value } else if ( value !== undefined ) { chainable = true; if ( !isFunction( value ) ) { raw = true; } if ( bulk ) { // Bulk operations run against the entire set if ( raw ) { fn.call( elems, value ); fn = null; // ...except when executing function values } else { bulk = fn; fn = function( elem, key, value ) { return bulk.call( jQuery( elem ), value ); }; } } if ( fn ) { for ( ; i < len; i++ ) { fn( elems[ i ], key, raw ? value : value.call( elems[ i ], i, fn( elems[ i ], key ) ) ); } } } if ( chainable ) { return elems; } // Gets if ( bulk ) { return fn.call( elems ); } return len ? fn( elems[ 0 ], key ) : emptyGet; }; // Matches dashed string for camelizing var rmsPrefix = /^-ms-/, rdashAlpha = /-([a-z])/g; // Used by camelCase as callback to replace() function fcamelCase( all, letter ) { return letter.toUpperCase(); } // Convert dashed to camelCase; used by the css and data modules // Support: IE <=9 - 11, Edge 12 - 15 // Microsoft forgot to hump their vendor prefix (#9572) function camelCase( string ) { return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); } var acceptData = function( owner ) { // Accepts only: // - Node // - Node.ELEMENT_NODE // - Node.DOCUMENT_NODE // - Object // - Any return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); }; function Data() { this.expando = jQuery.expando + Data.uid++; } Data.uid = 1; Data.prototype = { cache: function( owner ) { // Check if the owner object already has a cache var value = owner[ this.expando ]; // If not, create one if ( !value ) { value = {}; // We can accept data for non-element nodes in modern browsers, // but we should not, see #8335. // Always return an empty object. if ( acceptData( owner ) ) { // If it is a node unlikely to be stringify-ed or looped over // use plain assignment if ( owner.nodeType ) { owner[ this.expando ] = value; // Otherwise secure it in a non-enumerable property // configurable must be true to allow the property to be // deleted when data is removed } else { Object.defineProperty( owner, this.expando, { value: value, configurable: true } ); } } } return value; }, set: function( owner, data, value ) { var prop, cache = this.cache( owner ); // Handle: [ owner, key, value ] args // Always use camelCase key (gh-2257) if ( typeof data === "string" ) { cache[ camelCase( data ) ] = value; // Handle: [ owner, { properties } ] args } else { // Copy the properties one-by-one to the cache object for ( prop in data ) { cache[ camelCase( prop ) ] = data[ prop ]; } } return cache; }, get: function( owner, key ) { return key === undefined ? this.cache( owner ) : // Always use camelCase key (gh-2257) owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; }, access: function( owner, key, value ) { // In cases where either: // // 1. No key was specified // 2. A string key was specified, but no value provided // // Take the "read" path and allow the get method to determine // which value to return, respectively either: // // 1. The entire cache object // 2. The data stored at the key // if ( key === undefined || ( ( key && typeof key === "string" ) && value === undefined ) ) { return this.get( owner, key ); } // When the key is not a string, or both a key and value // are specified, set or extend (existing objects) with either: // // 1. An object of properties // 2. A key and value // this.set( owner, key, value ); // Since the "set" path can have two possible entry points // return the expected data based on which path was taken[*] return value !== undefined ? value : key; }, remove: function( owner, key ) { var i, cache = owner[ this.expando ]; if ( cache === undefined ) { return; } if ( key !== undefined ) { // Support array or space separated string of keys if ( Array.isArray( key ) ) { // If key is an array of keys... // We always set camelCase keys, so remove that. key = key.map( camelCase ); } else { key = camelCase( key ); // If a key with the spaces exists, use it. // Otherwise, create an array by matching non-whitespace key = key in cache ? [ key ] : ( key.match( rnothtmlwhite ) || [] ); } i = key.length; while ( i-- ) { delete cache[ key[ i ] ]; } } // Remove the expando if there's no more data if ( key === undefined || jQuery.isEmptyObject( cache ) ) { // Support: Chrome <=35 - 45 // Webkit & Blink performance suffers when deleting properties // from DOM nodes, so set to undefined instead // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) if ( owner.nodeType ) { owner[ this.expando ] = undefined; } else { delete owner[ this.expando ]; } } }, hasData: function( owner ) { var cache = owner[ this.expando ]; return cache !== undefined && !jQuery.isEmptyObject( cache ); } }; var dataPriv = new Data(); var dataUser = new Data(); // Implementation Summary // // 1. Enforce API surface and semantic compatibility with 1.9.x branch // 2. Improve the module's maintainability by reducing the storage // paths to a single mechanism. // 3. Use the same single mechanism to support "private" and "user" data. // 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) // 5. Avoid exposing implementation details on user objects (eg. expando properties) // 6. Provide a clear path for implementation upgrade to WeakMap in 2014 var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, rmultiDash = /[A-Z]/g; function getData( data ) { if ( data === "true" ) { return true; } if ( data === "false" ) { return false; } if ( data === "null" ) { return null; } // Only convert to a number if it doesn't change the string if ( data === +data + "" ) { return +data; } if ( rbrace.test( data ) ) { return JSON.parse( data ); } return data; } function dataAttr( elem, key, data ) { var name; // If nothing was found internally, try to fetch any // data from the HTML5 data-* attribute if ( data === undefined && elem.nodeType === 1 ) { name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); data = elem.getAttribute( name ); if ( typeof data === "string" ) { try { data = getData( data ); } catch ( e ) {} // Make sure we set the data so it isn't changed later dataUser.set( elem, key, data ); } else { data = undefined; } } return data; } jQuery.extend( { hasData: function( elem ) { return dataUser.hasData( elem ) || dataPriv.hasData( elem ); }, data: function( elem, name, data ) { return dataUser.access( elem, name, data ); }, removeData: function( elem, name ) { dataUser.remove( elem, name ); }, // TODO: Now that all calls to _data and _removeData have been replaced // with direct calls to dataPriv methods, these can be deprecated. _data: function( elem, name, data ) { return dataPriv.access( elem, name, data ); }, _removeData: function( elem, name ) { dataPriv.remove( elem, name ); } } ); jQuery.fn.extend( { data: function( key, value ) { var i, name, data, elem = this[ 0 ], attrs = elem && elem.attributes; // Gets all values if ( key === undefined ) { if ( this.length ) { data = dataUser.get( elem ); if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { i = attrs.length; while ( i-- ) { // Support: IE 11 only // The attrs elements can be null (#14894) if ( attrs[ i ] ) { name = attrs[ i ].name; if ( name.indexOf( "data-" ) === 0 ) { name = camelCase( name.slice( 5 ) ); dataAttr( elem, name, data[ name ] ); } } } dataPriv.set( elem, "hasDataAttrs", true ); } } return data; } // Sets multiple values if ( typeof key === "object" ) { return this.each( function() { dataUser.set( this, key ); } ); } return access( this, function( value ) { var data; // The calling jQuery object (element matches) is not empty // (and therefore has an element appears at this[ 0 ]) and the // `value` parameter was not undefined. An empty jQuery object // will result in `undefined` for elem = this[ 0 ] which will // throw an exception if an attempt to read a data cache is made. if ( elem && value === undefined ) { // Attempt to get data from the cache // The key will always be camelCased in Data data = dataUser.get( elem, key ); if ( data !== undefined ) { return data; } // Attempt to "discover" the data in // HTML5 custom data-* attrs data = dataAttr( elem, key ); if ( data !== undefined ) { return data; } // We tried really hard, but the data doesn't exist. return; } // Set the data... this.each( function() { // We always store the camelCased key dataUser.set( this, key, value ); } ); }, null, value, arguments.length > 1, null, true ); }, removeData: function( key ) { return this.each( function() { dataUser.remove( this, key ); } ); } } ); jQuery.extend( { queue: function( elem, type, data ) { var queue; if ( elem ) { type = ( type || "fx" ) + "queue"; queue = dataPriv.get( elem, type ); // Speed up dequeue by getting out quickly if this is just a lookup if ( data ) { if ( !queue || Array.isArray( data ) ) { queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); } else { queue.push( data ); } } return queue || []; } }, dequeue: function( elem, type ) { type = type || "fx"; var queue = jQuery.queue( elem, type ), startLength = queue.length, fn = queue.shift(), hooks = jQuery._queueHooks( elem, type ), next = function() { jQuery.dequeue( elem, type ); }; // If the fx queue is dequeued, always remove the progress sentinel if ( fn === "inprogress" ) { fn = queue.shift(); startLength--; } if ( fn ) { // Add a progress sentinel to prevent the fx queue from being // automatically dequeued if ( type === "fx" ) { queue.unshift( "inprogress" ); } // Clear up the last queue stop function delete hooks.stop; fn.call( elem, next, hooks ); } if ( !startLength && hooks ) { hooks.empty.fire(); } }, // Not public - generate a queueHooks object, or return the current one _queueHooks: function( elem, type ) { var key = type + "queueHooks"; return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { empty: jQuery.Callbacks( "once memory" ).add( function() { dataPriv.remove( elem, [ type + "queue", key ] ); } ) } ); } } ); jQuery.fn.extend( { queue: function( type, data ) { var setter = 2; if ( typeof type !== "string" ) { data = type; type = "fx"; setter--; } if ( arguments.length < setter ) { return jQuery.queue( this[ 0 ], type ); } return data === undefined ? this : this.each( function() { var queue = jQuery.queue( this, type, data ); // Ensure a hooks for this queue jQuery._queueHooks( this, type ); if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { jQuery.dequeue( this, type ); } } ); }, dequeue: function( type ) { return this.each( function() { jQuery.dequeue( this, type ); } ); }, clearQueue: function( type ) { return this.queue( type || "fx", [] ); }, // Get a promise resolved when queues of a certain type // are emptied (fx is the type by default) promise: function( type, obj ) { var tmp, count = 1, defer = jQuery.Deferred(), elements = this, i = this.length, resolve = function() { if ( !( --count ) ) { defer.resolveWith( elements, [ elements ] ); } }; if ( typeof type !== "string" ) { obj = type; type = undefined; } type = type || "fx"; while ( i-- ) { tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); if ( tmp && tmp.empty ) { count++; tmp.empty.add( resolve ); } } resolve(); return defer.promise( obj ); } } ); var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; var documentElement = document.documentElement; var isAttached = function( elem ) { return jQuery.contains( elem.ownerDocument, elem ); }, composed = { composed: true }; // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only // Check attachment across shadow DOM boundaries when possible (gh-3504) // Support: iOS 10.0-10.2 only // Early iOS 10 versions support `attachShadow` but not `getRootNode`, // leading to errors. We need to check for `getRootNode`. if ( documentElement.getRootNode ) { isAttached = function( elem ) { return jQuery.contains( elem.ownerDocument, elem ) || elem.getRootNode( composed ) === elem.ownerDocument; }; } var isHiddenWithinTree = function( elem, el ) { // isHiddenWithinTree might be called from jQuery#filter function; // in that case, element will be second argument elem = el || elem; // Inline style trumps all return elem.style.display === "none" || elem.style.display === "" && // Otherwise, check computed style // Support: Firefox <=43 - 45 // Disconnected elements can have computed display: none, so first confirm that elem is // in the document. isAttached( elem ) && jQuery.css( elem, "display" ) === "none"; }; var swap = function( elem, options, callback, args ) { var ret, name, old = {}; // Remember the old values, and insert the new ones for ( name in options ) { old[ name ] = elem.style[ name ]; elem.style[ name ] = options[ name ]; } ret = callback.apply( elem, args || [] ); // Revert the old values for ( name in options ) { elem.style[ name ] = old[ name ]; } return ret; }; function adjustCSS( elem, prop, valueParts, tween ) { var adjusted, scale, maxIterations = 20, currentValue = tween ? function() { return tween.cur(); } : function() { return jQuery.css( elem, prop, "" ); }, initial = currentValue(), unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), // Starting value computation is required for potential unit mismatches initialInUnit = elem.nodeType && ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && rcssNum.exec( jQuery.css( elem, prop ) ); if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { // Support: Firefox <=54 // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) initial = initial / 2; // Trust units reported by jQuery.css unit = unit || initialInUnit[ 3 ]; // Iteratively approximate from a nonzero starting point initialInUnit = +initial || 1; while ( maxIterations-- ) { // Evaluate and update our best guess (doubling guesses that zero out). // Finish if the scale equals or crosses 1 (making the old*new product non-positive). jQuery.style( elem, prop, initialInUnit + unit ); if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { maxIterations = 0; } initialInUnit = initialInUnit / scale; } initialInUnit = initialInUnit * 2; jQuery.style( elem, prop, initialInUnit + unit ); // Make sure we update the tween properties later on valueParts = valueParts || []; } if ( valueParts ) { initialInUnit = +initialInUnit || +initial || 0; // Apply relative offset (+=/-=) if specified adjusted = valueParts[ 1 ] ? initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : +valueParts[ 2 ]; if ( tween ) { tween.unit = unit; tween.start = initialInUnit; tween.end = adjusted; } } return adjusted; } var defaultDisplayMap = {}; function getDefaultDisplay( elem ) { var temp, doc = elem.ownerDocument, nodeName = elem.nodeName, display = defaultDisplayMap[ nodeName ]; if ( display ) { return display; } temp = doc.body.appendChild( doc.createElement( nodeName ) ); display = jQuery.css( temp, "display" ); temp.parentNode.removeChild( temp ); if ( display === "none" ) { display = "block"; } defaultDisplayMap[ nodeName ] = display; return display; } function showHide( elements, show ) { var display, elem, values = [], index = 0, length = elements.length; // Determine new display value for elements that need to change for ( ; index < length; index++ ) { elem = elements[ index ]; if ( !elem.style ) { continue; } display = elem.style.display; if ( show ) { // Since we force visibility upon cascade-hidden elements, an immediate (and slow) // check is required in this first loop unless we have a nonempty display value (either // inline or about-to-be-restored) if ( display === "none" ) { values[ index ] = dataPriv.get( elem, "display" ) || null; if ( !values[ index ] ) { elem.style.display = ""; } } if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { values[ index ] = getDefaultDisplay( elem ); } } else { if ( display !== "none" ) { values[ index ] = "none"; // Remember what we're overwriting dataPriv.set( elem, "display", display ); } } } // Set the display of the elements in a second loop to avoid constant reflow for ( index = 0; index < length; index++ ) { if ( values[ index ] != null ) { elements[ index ].style.display = values[ index ]; } } return elements; } jQuery.fn.extend( { show: function() { return showHide( this, true ); }, hide: function() { return showHide( this ); }, toggle: function( state ) { if ( typeof state === "boolean" ) { return state ? this.show() : this.hide(); } return this.each( function() { if ( isHiddenWithinTree( this ) ) { jQuery( this ).show(); } else { jQuery( this ).hide(); } } ); } } ); var rcheckableType = ( /^(?:checkbox|radio)$/i ); var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); // We have to close these tags to support XHTML (#13200) var wrapMap = { // Support: IE <=9 only option: [ 1, "" ], // XHTML parsers do not magically insert elements in the // same way that tag soup parsers do. So we cannot shorten // this by omitting or other required elements. thead: [ 1, "", "
" ], col: [ 2, "", "
" ], tr: [ 2, "", "
" ], td: [ 3, "", "
" ], _default: [ 0, "", "" ] }; // Support: IE <=9 only wrapMap.optgroup = wrapMap.option; wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; wrapMap.th = wrapMap.td; function getAll( context, tag ) { // Support: IE <=9 - 11 only // Use typeof to avoid zero-argument method invocation on host objects (#15151) var ret; if ( typeof context.getElementsByTagName !== "undefined" ) { ret = context.getElementsByTagName( tag || "*" ); } else if ( typeof context.querySelectorAll !== "undefined" ) { ret = context.querySelectorAll( tag || "*" ); } else { ret = []; } if ( tag === undefined || tag && nodeName( context, tag ) ) { return jQuery.merge( [ context ], ret ); } return ret; } // Mark scripts as having already been evaluated function setGlobalEval( elems, refElements ) { var i = 0, l = elems.length; for ( ; i < l; i++ ) { dataPriv.set( elems[ i ], "globalEval", !refElements || dataPriv.get( refElements[ i ], "globalEval" ) ); } } var rhtml = /<|&#?\w+;/; function buildFragment( elems, context, scripts, selection, ignored ) { var elem, tmp, tag, wrap, attached, j, fragment = context.createDocumentFragment(), nodes = [], i = 0, l = elems.length; for ( ; i < l; i++ ) { elem = elems[ i ]; if ( elem || elem === 0 ) { // Add nodes directly if ( toType( elem ) === "object" ) { // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); // Convert non-html into a text node } else if ( !rhtml.test( elem ) ) { nodes.push( context.createTextNode( elem ) ); // Convert html into DOM nodes } else { tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); // Deserialize a standard representation tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); wrap = wrapMap[ tag ] || wrapMap._default; tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; // Descend through wrappers to the right content j = wrap[ 0 ]; while ( j-- ) { tmp = tmp.lastChild; } // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( nodes, tmp.childNodes ); // Remember the top-level container tmp = fragment.firstChild; // Ensure the created nodes are orphaned (#12392) tmp.textContent = ""; } } } // Remove wrapper from fragment fragment.textContent = ""; i = 0; while ( ( elem = nodes[ i++ ] ) ) { // Skip elements already in the context collection (trac-4087) if ( selection && jQuery.inArray( elem, selection ) > -1 ) { if ( ignored ) { ignored.push( elem ); } continue; } attached = isAttached( elem ); // Append to fragment tmp = getAll( fragment.appendChild( elem ), "script" ); // Preserve script evaluation history if ( attached ) { setGlobalEval( tmp ); } // Capture executables if ( scripts ) { j = 0; while ( ( elem = tmp[ j++ ] ) ) { if ( rscriptType.test( elem.type || "" ) ) { scripts.push( elem ); } } } } return fragment; } ( function() { var fragment = document.createDocumentFragment(), div = fragment.appendChild( document.createElement( "div" ) ), input = document.createElement( "input" ); // Support: Android 4.0 - 4.3 only // Check state lost if the name is set (#11217) // Support: Windows Web Apps (WWA) // `name` and `type` must use .setAttribute for WWA (#14901) input.setAttribute( "type", "radio" ); input.setAttribute( "checked", "checked" ); input.setAttribute( "name", "t" ); div.appendChild( input ); // Support: Android <=4.1 only // Older WebKit doesn't clone checked state correctly in fragments support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; // Support: IE <=11 only // Make sure textarea (and checkbox) defaultValue is properly cloned div.innerHTML = ""; support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; } )(); var rkeyEvent = /^key/, rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, rtypenamespace = /^([^.]*)(?:\.(.+)|)/; function returnTrue() { return true; } function returnFalse() { return false; } // Support: IE <=9 - 11+ // focus() and blur() are asynchronous, except when they are no-op. // So expect focus to be synchronous when the element is already active, // and blur to be synchronous when the element is not already active. // (focus and blur are always synchronous in other supported browsers, // this just defines when we can count on it). function expectSync( elem, type ) { return ( elem === safeActiveElement() ) === ( type === "focus" ); } // Support: IE <=9 only // Accessing document.activeElement can throw unexpectedly // https://bugs.jquery.com/ticket/13393 function safeActiveElement() { try { return document.activeElement; } catch ( err ) { } } function on( elem, types, selector, data, fn, one ) { var origFn, type; // Types can be a map of types/handlers if ( typeof types === "object" ) { // ( types-Object, selector, data ) if ( typeof selector !== "string" ) { // ( types-Object, data ) data = data || selector; selector = undefined; } for ( type in types ) { on( elem, type, selector, data, types[ type ], one ); } return elem; } if ( data == null && fn == null ) { // ( types, fn ) fn = selector; data = selector = undefined; } else if ( fn == null ) { if ( typeof selector === "string" ) { // ( types, selector, fn ) fn = data; data = undefined; } else { // ( types, data, fn ) fn = data; data = selector; selector = undefined; } } if ( fn === false ) { fn = returnFalse; } else if ( !fn ) { return elem; } if ( one === 1 ) { origFn = fn; fn = function( event ) { // Can use an empty set, since event contains the info jQuery().off( event ); return origFn.apply( this, arguments ); }; // Use same guid so caller can remove using origFn fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); } return elem.each( function() { jQuery.event.add( this, types, fn, data, selector ); } ); } /* * Helper functions for managing events -- not part of the public interface. * Props to Dean Edwards' addEvent library for many of the ideas. */ jQuery.event = { global: {}, add: function( elem, types, handler, data, selector ) { var handleObjIn, eventHandle, tmp, events, t, handleObj, special, handlers, type, namespaces, origType, elemData = dataPriv.get( elem ); // Don't attach events to noData or text/comment nodes (but allow plain objects) if ( !elemData ) { return; } // Caller can pass in an object of custom data in lieu of the handler if ( handler.handler ) { handleObjIn = handler; handler = handleObjIn.handler; selector = handleObjIn.selector; } // Ensure that invalid selectors throw exceptions at attach time // Evaluate against documentElement in case elem is a non-element node (e.g., document) if ( selector ) { jQuery.find.matchesSelector( documentElement, selector ); } // Make sure that the handler has a unique ID, used to find/remove it later if ( !handler.guid ) { handler.guid = jQuery.guid++; } // Init the element's event structure and main handler, if this is the first if ( !( events = elemData.events ) ) { events = elemData.events = {}; } if ( !( eventHandle = elemData.handle ) ) { eventHandle = elemData.handle = function( e ) { // Discard the second event of a jQuery.event.trigger() and // when an event is called after a page has unloaded return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? jQuery.event.dispatch.apply( elem, arguments ) : undefined; }; } // Handle multiple events separated by a space types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; t = types.length; while ( t-- ) { tmp = rtypenamespace.exec( types[ t ] ) || []; type = origType = tmp[ 1 ]; namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); // There *must* be a type, no attaching namespace-only handlers if ( !type ) { continue; } // If event changes its type, use the special event handlers for the changed type special = jQuery.event.special[ type ] || {}; // If selector defined, determine special event api type, otherwise given type type = ( selector ? special.delegateType : special.bindType ) || type; // Update special based on newly reset type special = jQuery.event.special[ type ] || {}; // handleObj is passed to all event handlers handleObj = jQuery.extend( { type: type, origType: origType, data: data, handler: handler, guid: handler.guid, selector: selector, needsContext: selector && jQuery.expr.match.needsContext.test( selector ), namespace: namespaces.join( "." ) }, handleObjIn ); // Init the event handler queue if we're the first if ( !( handlers = events[ type ] ) ) { handlers = events[ type ] = []; handlers.delegateCount = 0; // Only use addEventListener if the special events handler returns false if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) { if ( elem.addEventListener ) { elem.addEventListener( type, eventHandle ); } } } if ( special.add ) { special.add.call( elem, handleObj ); if ( !handleObj.handler.guid ) { handleObj.handler.guid = handler.guid; } } // Add to the element's handler list, delegates in front if ( selector ) { handlers.splice( handlers.delegateCount++, 0, handleObj ); } else { handlers.push( handleObj ); } // Keep track of which events have ever been used, for event optimization jQuery.event.global[ type ] = true; } }, // Detach an event or set of events from an element remove: function( elem, types, handler, selector, mappedTypes ) { var j, origCount, tmp, events, t, handleObj, special, handlers, type, namespaces, origType, elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); if ( !elemData || !( events = elemData.events ) ) { return; } // Once for each type.namespace in types; type may be omitted types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; t = types.length; while ( t-- ) { tmp = rtypenamespace.exec( types[ t ] ) || []; type = origType = tmp[ 1 ]; namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); // Unbind all events (on this namespace, if provided) for the element if ( !type ) { for ( type in events ) { jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); } continue; } special = jQuery.event.special[ type ] || {}; type = ( selector ? special.delegateType : special.bindType ) || type; handlers = events[ type ] || []; tmp = tmp[ 2 ] && new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); // Remove matching events origCount = j = handlers.length; while ( j-- ) { handleObj = handlers[ j ]; if ( ( mappedTypes || origType === handleObj.origType ) && ( !handler || handler.guid === handleObj.guid ) && ( !tmp || tmp.test( handleObj.namespace ) ) && ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) { handlers.splice( j, 1 ); if ( handleObj.selector ) { handlers.delegateCount--; } if ( special.remove ) { special.remove.call( elem, handleObj ); } } } // Remove generic event handler if we removed something and no more handlers exist // (avoids potential for endless recursion during removal of special event handlers) if ( origCount && !handlers.length ) { if ( !special.teardown || special.teardown.call( elem, namespaces, elemData.handle ) === false ) { jQuery.removeEvent( elem, type, elemData.handle ); } delete events[ type ]; } } // Remove data and the expando if it's no longer used if ( jQuery.isEmptyObject( events ) ) { dataPriv.remove( elem, "handle events" ); } }, dispatch: function( nativeEvent ) { // Make a writable jQuery.Event from the native event object var event = jQuery.event.fix( nativeEvent ); var i, j, ret, matched, handleObj, handlerQueue, args = new Array( arguments.length ), handlers = ( dataPriv.get( this, "events" ) || {} )[ event.type ] || [], special = jQuery.event.special[ event.type ] || {}; // Use the fix-ed jQuery.Event rather than the (read-only) native event args[ 0 ] = event; for ( i = 1; i < arguments.length; i++ ) { args[ i ] = arguments[ i ]; } event.delegateTarget = this; // Call the preDispatch hook for the mapped type, and let it bail if desired if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { return; } // Determine handlers handlerQueue = jQuery.event.handlers.call( this, event, handlers ); // Run delegates first; they may want to stop propagation beneath us i = 0; while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { event.currentTarget = matched.elem; j = 0; while ( ( handleObj = matched.handlers[ j++ ] ) && !event.isImmediatePropagationStopped() ) { // If the event is namespaced, then each handler is only invoked if it is // specially universal or its namespaces are a superset of the event's. if ( !event.rnamespace || handleObj.namespace === false || event.rnamespace.test( handleObj.namespace ) ) { event.handleObj = handleObj; event.data = handleObj.data; ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || handleObj.handler ).apply( matched.elem, args ); if ( ret !== undefined ) { if ( ( event.result = ret ) === false ) { event.preventDefault(); event.stopPropagation(); } } } } } // Call the postDispatch hook for the mapped type if ( special.postDispatch ) { special.postDispatch.call( this, event ); } return event.result; }, handlers: function( event, handlers ) { var i, handleObj, sel, matchedHandlers, matchedSelectors, handlerQueue = [], delegateCount = handlers.delegateCount, cur = event.target; // Find delegate handlers if ( delegateCount && // Support: IE <=9 // Black-hole SVG instance trees (trac-13180) cur.nodeType && // Support: Firefox <=42 // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click // Support: IE 11 only // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) !( event.type === "click" && event.button >= 1 ) ) { for ( ; cur !== this; cur = cur.parentNode || this ) { // Don't check non-elements (#13208) // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { matchedHandlers = []; matchedSelectors = {}; for ( i = 0; i < delegateCount; i++ ) { handleObj = handlers[ i ]; // Don't conflict with Object.prototype properties (#13203) sel = handleObj.selector + " "; if ( matchedSelectors[ sel ] === undefined ) { matchedSelectors[ sel ] = handleObj.needsContext ? jQuery( sel, this ).index( cur ) > -1 : jQuery.find( sel, this, null, [ cur ] ).length; } if ( matchedSelectors[ sel ] ) { matchedHandlers.push( handleObj ); } } if ( matchedHandlers.length ) { handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); } } } } // Add the remaining (directly-bound) handlers cur = this; if ( delegateCount < handlers.length ) { handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); } return handlerQueue; }, addProp: function( name, hook ) { Object.defineProperty( jQuery.Event.prototype, name, { enumerable: true, configurable: true, get: isFunction( hook ) ? function() { if ( this.originalEvent ) { return hook( this.originalEvent ); } } : function() { if ( this.originalEvent ) { return this.originalEvent[ name ]; } }, set: function( value ) { Object.defineProperty( this, name, { enumerable: true, configurable: true, writable: true, value: value } ); } } ); }, fix: function( originalEvent ) { return originalEvent[ jQuery.expando ] ? originalEvent : new jQuery.Event( originalEvent ); }, special: { load: { // Prevent triggered image.load events from bubbling to window.load noBubble: true }, click: { // Utilize native event to ensure correct state for checkable inputs setup: function( data ) { // For mutual compressibility with _default, replace `this` access with a local var. // `|| data` is dead code meant only to preserve the variable through minification. var el = this || data; // Claim the first handler if ( rcheckableType.test( el.type ) && el.click && nodeName( el, "input" ) ) { // dataPriv.set( el, "click", ... ) leverageNative( el, "click", returnTrue ); } // Return false to allow normal processing in the caller return false; }, trigger: function( data ) { // For mutual compressibility with _default, replace `this` access with a local var. // `|| data` is dead code meant only to preserve the variable through minification. var el = this || data; // Force setup before triggering a click if ( rcheckableType.test( el.type ) && el.click && nodeName( el, "input" ) ) { leverageNative( el, "click" ); } // Return non-false to allow normal event-path propagation return true; }, // For cross-browser consistency, suppress native .click() on links // Also prevent it if we're currently inside a leveraged native-event stack _default: function( event ) { var target = event.target; return rcheckableType.test( target.type ) && target.click && nodeName( target, "input" ) && dataPriv.get( target, "click" ) || nodeName( target, "a" ); } }, beforeunload: { postDispatch: function( event ) { // Support: Firefox 20+ // Firefox doesn't alert if the returnValue field is not set. if ( event.result !== undefined && event.originalEvent ) { event.originalEvent.returnValue = event.result; } } } } }; // Ensure the presence of an event listener that handles manually-triggered // synthetic events by interrupting progress until reinvoked in response to // *native* events that it fires directly, ensuring that state changes have // already occurred before other listeners are invoked. function leverageNative( el, type, expectSync ) { // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add if ( !expectSync ) { if ( dataPriv.get( el, type ) === undefined ) { jQuery.event.add( el, type, returnTrue ); } return; } // Register the controller as a special universal handler for all event namespaces dataPriv.set( el, type, false ); jQuery.event.add( el, type, { namespace: false, handler: function( event ) { var notAsync, result, saved = dataPriv.get( this, type ); if ( ( event.isTrigger & 1 ) && this[ type ] ) { // Interrupt processing of the outer synthetic .trigger()ed event // Saved data should be false in such cases, but might be a leftover capture object // from an async native handler (gh-4350) if ( !saved.length ) { // Store arguments for use when handling the inner native event // There will always be at least one argument (an event object), so this array // will not be confused with a leftover capture object. saved = slice.call( arguments ); dataPriv.set( this, type, saved ); // Trigger the native event and capture its result // Support: IE <=9 - 11+ // focus() and blur() are asynchronous notAsync = expectSync( this, type ); this[ type ](); result = dataPriv.get( this, type ); if ( saved !== result || notAsync ) { dataPriv.set( this, type, false ); } else { result = {}; } if ( saved !== result ) { // Cancel the outer synthetic event event.stopImmediatePropagation(); event.preventDefault(); return result.value; } // If this is an inner synthetic event for an event with a bubbling surrogate // (focus or blur), assume that the surrogate already propagated from triggering the // native event and prevent that from happening again here. // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the // bubbling surrogate propagates *after* the non-bubbling base), but that seems // less bad than duplication. } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { event.stopPropagation(); } // If this is a native event triggered above, everything is now in order // Fire an inner synthetic event with the original arguments } else if ( saved.length ) { // ...and capture the result dataPriv.set( this, type, { value: jQuery.event.trigger( // Support: IE <=9 - 11+ // Extend with the prototype to reset the above stopImmediatePropagation() jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), saved.slice( 1 ), this ) } ); // Abort handling of the native event event.stopImmediatePropagation(); } } } ); } jQuery.removeEvent = function( elem, type, handle ) { // This "if" is needed for plain objects if ( elem.removeEventListener ) { elem.removeEventListener( type, handle ); } }; jQuery.Event = function( src, props ) { // Allow instantiation without the 'new' keyword if ( !( this instanceof jQuery.Event ) ) { return new jQuery.Event( src, props ); } // Event object if ( src && src.type ) { this.originalEvent = src; this.type = src.type; // Events bubbling up the document may have been marked as prevented // by a handler lower down the tree; reflect the correct value. this.isDefaultPrevented = src.defaultPrevented || src.defaultPrevented === undefined && // Support: Android <=2.3 only src.returnValue === false ? returnTrue : returnFalse; // Create target properties // Support: Safari <=6 - 7 only // Target should not be a text node (#504, #13143) this.target = ( src.target && src.target.nodeType === 3 ) ? src.target.parentNode : src.target; this.currentTarget = src.currentTarget; this.relatedTarget = src.relatedTarget; // Event type } else { this.type = src; } // Put explicitly provided properties onto the event object if ( props ) { jQuery.extend( this, props ); } // Create a timestamp if incoming event doesn't have one this.timeStamp = src && src.timeStamp || Date.now(); // Mark it as fixed this[ jQuery.expando ] = true; }; // jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding // https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html jQuery.Event.prototype = { constructor: jQuery.Event, isDefaultPrevented: returnFalse, isPropagationStopped: returnFalse, isImmediatePropagationStopped: returnFalse, isSimulated: false, preventDefault: function() { var e = this.originalEvent; this.isDefaultPrevented = returnTrue; if ( e && !this.isSimulated ) { e.preventDefault(); } }, stopPropagation: function() { var e = this.originalEvent; this.isPropagationStopped = returnTrue; if ( e && !this.isSimulated ) { e.stopPropagation(); } }, stopImmediatePropagation: function() { var e = this.originalEvent; this.isImmediatePropagationStopped = returnTrue; if ( e && !this.isSimulated ) { e.stopImmediatePropagation(); } this.stopPropagation(); } }; // Includes all common event props including KeyEvent and MouseEvent specific props jQuery.each( { altKey: true, bubbles: true, cancelable: true, changedTouches: true, ctrlKey: true, detail: true, eventPhase: true, metaKey: true, pageX: true, pageY: true, shiftKey: true, view: true, "char": true, code: true, charCode: true, key: true, keyCode: true, button: true, buttons: true, clientX: true, clientY: true, offsetX: true, offsetY: true, pointerId: true, pointerType: true, screenX: true, screenY: true, targetTouches: true, toElement: true, touches: true, which: function( event ) { var button = event.button; // Add which for key events if ( event.which == null && rkeyEvent.test( event.type ) ) { return event.charCode != null ? event.charCode : event.keyCode; } // Add which for click: 1 === left; 2 === middle; 3 === right if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { if ( button & 1 ) { return 1; } if ( button & 2 ) { return 3; } if ( button & 4 ) { return 2; } return 0; } return event.which; } }, jQuery.event.addProp ); jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { jQuery.event.special[ type ] = { // Utilize native event if possible so blur/focus sequence is correct setup: function() { // Claim the first handler // dataPriv.set( this, "focus", ... ) // dataPriv.set( this, "blur", ... ) leverageNative( this, type, expectSync ); // Return false to allow normal processing in the caller return false; }, trigger: function() { // Force setup before trigger leverageNative( this, type ); // Return non-false to allow normal event-path propagation return true; }, delegateType: delegateType }; } ); // Create mouseenter/leave events using mouseover/out and event-time checks // so that event delegation works in jQuery. // Do the same for pointerenter/pointerleave and pointerover/pointerout // // Support: Safari 7 only // Safari sends mouseenter too often; see: // https://bugs.chromium.org/p/chromium/issues/detail?id=470258 // for the description of the bug (it existed in older Chrome versions as well). jQuery.each( { mouseenter: "mouseover", mouseleave: "mouseout", pointerenter: "pointerover", pointerleave: "pointerout" }, function( orig, fix ) { jQuery.event.special[ orig ] = { delegateType: fix, bindType: fix, handle: function( event ) { var ret, target = this, related = event.relatedTarget, handleObj = event.handleObj; // For mouseenter/leave call the handler if related is outside the target. // NB: No relatedTarget if the mouse left/entered the browser window if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { event.type = handleObj.origType; ret = handleObj.handler.apply( this, arguments ); event.type = fix; } return ret; } }; } ); jQuery.fn.extend( { on: function( types, selector, data, fn ) { return on( this, types, selector, data, fn ); }, one: function( types, selector, data, fn ) { return on( this, types, selector, data, fn, 1 ); }, off: function( types, selector, fn ) { var handleObj, type; if ( types && types.preventDefault && types.handleObj ) { // ( event ) dispatched jQuery.Event handleObj = types.handleObj; jQuery( types.delegateTarget ).off( handleObj.namespace ? handleObj.origType + "." + handleObj.namespace : handleObj.origType, handleObj.selector, handleObj.handler ); return this; } if ( typeof types === "object" ) { // ( types-object [, selector] ) for ( type in types ) { this.off( type, selector, types[ type ] ); } return this; } if ( selector === false || typeof selector === "function" ) { // ( types [, fn] ) fn = selector; selector = undefined; } if ( fn === false ) { fn = returnFalse; } return this.each( function() { jQuery.event.remove( this, types, fn, selector ); } ); } } ); var /* eslint-disable max-len */ // See https://github.com/eslint/eslint/issues/3229 rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([a-z][^\/\0>\x20\t\r\n\f]*)[^>]*)\/>/gi, /* eslint-enable */ // Support: IE <=10 - 11, Edge 12 - 13 only // In IE/Edge using regex groups here causes severe slowdowns. // See https://connect.microsoft.com/IE/feedback/details/1736512/ rnoInnerhtml = /\s*$/g; // Prefer a tbody over its parent table for containing new rows function manipulationTarget( elem, content ) { if ( nodeName( elem, "table" ) && nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { return jQuery( elem ).children( "tbody" )[ 0 ] || elem; } return elem; } // Replace/restore the type attribute of script elements for safe DOM manipulation function disableScript( elem ) { elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; return elem; } function restoreScript( elem ) { if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { elem.type = elem.type.slice( 5 ); } else { elem.removeAttribute( "type" ); } return elem; } function cloneCopyEvent( src, dest ) { var i, l, type, pdataOld, pdataCur, udataOld, udataCur, events; if ( dest.nodeType !== 1 ) { return; } // 1. Copy private data: events, handlers, etc. if ( dataPriv.hasData( src ) ) { pdataOld = dataPriv.access( src ); pdataCur = dataPriv.set( dest, pdataOld ); events = pdataOld.events; if ( events ) { delete pdataCur.handle; pdataCur.events = {}; for ( type in events ) { for ( i = 0, l = events[ type ].length; i < l; i++ ) { jQuery.event.add( dest, type, events[ type ][ i ] ); } } } } // 2. Copy user data if ( dataUser.hasData( src ) ) { udataOld = dataUser.access( src ); udataCur = jQuery.extend( {}, udataOld ); dataUser.set( dest, udataCur ); } } // Fix IE bugs, see support tests function fixInput( src, dest ) { var nodeName = dest.nodeName.toLowerCase(); // Fails to persist the checked state of a cloned checkbox or radio button. if ( nodeName === "input" && rcheckableType.test( src.type ) ) { dest.checked = src.checked; // Fails to return the selected option to the default selected state when cloning options } else if ( nodeName === "input" || nodeName === "textarea" ) { dest.defaultValue = src.defaultValue; } } function domManip( collection, args, callback, ignored ) { // Flatten any nested arrays args = concat.apply( [], args ); var fragment, first, scripts, hasScripts, node, doc, i = 0, l = collection.length, iNoClone = l - 1, value = args[ 0 ], valueIsFunction = isFunction( value ); // We can't cloneNode fragments that contain checked, in WebKit if ( valueIsFunction || ( l > 1 && typeof value === "string" && !support.checkClone && rchecked.test( value ) ) ) { return collection.each( function( index ) { var self = collection.eq( index ); if ( valueIsFunction ) { args[ 0 ] = value.call( this, index, self.html() ); } domManip( self, args, callback, ignored ); } ); } if ( l ) { fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); first = fragment.firstChild; if ( fragment.childNodes.length === 1 ) { fragment = first; } // Require either new content or an interest in ignored elements to invoke the callback if ( first || ignored ) { scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); hasScripts = scripts.length; // Use the original fragment for the last item // instead of the first because it can end up // being emptied incorrectly in certain situations (#8070). for ( ; i < l; i++ ) { node = fragment; if ( i !== iNoClone ) { node = jQuery.clone( node, true, true ); // Keep references to cloned scripts for later restoration if ( hasScripts ) { // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( scripts, getAll( node, "script" ) ); } } callback.call( collection[ i ], node, i ); } if ( hasScripts ) { doc = scripts[ scripts.length - 1 ].ownerDocument; // Reenable scripts jQuery.map( scripts, restoreScript ); // Evaluate executable scripts on first document insertion for ( i = 0; i < hasScripts; i++ ) { node = scripts[ i ]; if ( rscriptType.test( node.type || "" ) && !dataPriv.access( node, "globalEval" ) && jQuery.contains( doc, node ) ) { if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { // Optional AJAX dependency, but won't run scripts if not present if ( jQuery._evalUrl && !node.noModule ) { jQuery._evalUrl( node.src, { nonce: node.nonce || node.getAttribute( "nonce" ) } ); } } else { DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); } } } } } } return collection; } function remove( elem, selector, keepData ) { var node, nodes = selector ? jQuery.filter( selector, elem ) : elem, i = 0; for ( ; ( node = nodes[ i ] ) != null; i++ ) { if ( !keepData && node.nodeType === 1 ) { jQuery.cleanData( getAll( node ) ); } if ( node.parentNode ) { if ( keepData && isAttached( node ) ) { setGlobalEval( getAll( node, "script" ) ); } node.parentNode.removeChild( node ); } } return elem; } jQuery.extend( { htmlPrefilter: function( html ) { return html.replace( rxhtmlTag, "<$1>" ); }, clone: function( elem, dataAndEvents, deepDataAndEvents ) { var i, l, srcElements, destElements, clone = elem.cloneNode( true ), inPage = isAttached( elem ); // Fix IE cloning issues if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && !jQuery.isXMLDoc( elem ) ) { // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 destElements = getAll( clone ); srcElements = getAll( elem ); for ( i = 0, l = srcElements.length; i < l; i++ ) { fixInput( srcElements[ i ], destElements[ i ] ); } } // Copy the events from the original to the clone if ( dataAndEvents ) { if ( deepDataAndEvents ) { srcElements = srcElements || getAll( elem ); destElements = destElements || getAll( clone ); for ( i = 0, l = srcElements.length; i < l; i++ ) { cloneCopyEvent( srcElements[ i ], destElements[ i ] ); } } else { cloneCopyEvent( elem, clone ); } } // Preserve script evaluation history destElements = getAll( clone, "script" ); if ( destElements.length > 0 ) { setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); } // Return the cloned set return clone; }, cleanData: function( elems ) { var data, elem, type, special = jQuery.event.special, i = 0; for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { if ( acceptData( elem ) ) { if ( ( data = elem[ dataPriv.expando ] ) ) { if ( data.events ) { for ( type in data.events ) { if ( special[ type ] ) { jQuery.event.remove( elem, type ); // This is a shortcut to avoid jQuery.event.remove's overhead } else { jQuery.removeEvent( elem, type, data.handle ); } } } // Support: Chrome <=35 - 45+ // Assign undefined instead of using delete, see Data#remove elem[ dataPriv.expando ] = undefined; } if ( elem[ dataUser.expando ] ) { // Support: Chrome <=35 - 45+ // Assign undefined instead of using delete, see Data#remove elem[ dataUser.expando ] = undefined; } } } } } ); jQuery.fn.extend( { detach: function( selector ) { return remove( this, selector, true ); }, remove: function( selector ) { return remove( this, selector ); }, text: function( value ) { return access( this, function( value ) { return value === undefined ? jQuery.text( this ) : this.empty().each( function() { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { this.textContent = value; } } ); }, null, value, arguments.length ); }, append: function() { return domManip( this, arguments, function( elem ) { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { var target = manipulationTarget( this, elem ); target.appendChild( elem ); } } ); }, prepend: function() { return domManip( this, arguments, function( elem ) { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { var target = manipulationTarget( this, elem ); target.insertBefore( elem, target.firstChild ); } } ); }, before: function() { return domManip( this, arguments, function( elem ) { if ( this.parentNode ) { this.parentNode.insertBefore( elem, this ); } } ); }, after: function() { return domManip( this, arguments, function( elem ) { if ( this.parentNode ) { this.parentNode.insertBefore( elem, this.nextSibling ); } } ); }, empty: function() { var elem, i = 0; for ( ; ( elem = this[ i ] ) != null; i++ ) { if ( elem.nodeType === 1 ) { // Prevent memory leaks jQuery.cleanData( getAll( elem, false ) ); // Remove any remaining nodes elem.textContent = ""; } } return this; }, clone: function( dataAndEvents, deepDataAndEvents ) { dataAndEvents = dataAndEvents == null ? false : dataAndEvents; deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; return this.map( function() { return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); } ); }, html: function( value ) { return access( this, function( value ) { var elem = this[ 0 ] || {}, i = 0, l = this.length; if ( value === undefined && elem.nodeType === 1 ) { return elem.innerHTML; } // See if we can take a shortcut and just use innerHTML if ( typeof value === "string" && !rnoInnerhtml.test( value ) && !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { value = jQuery.htmlPrefilter( value ); try { for ( ; i < l; i++ ) { elem = this[ i ] || {}; // Remove element nodes and prevent memory leaks if ( elem.nodeType === 1 ) { jQuery.cleanData( getAll( elem, false ) ); elem.innerHTML = value; } } elem = 0; // If using innerHTML throws an exception, use the fallback method } catch ( e ) {} } if ( elem ) { this.empty().append( value ); } }, null, value, arguments.length ); }, replaceWith: function() { var ignored = []; // Make the changes, replacing each non-ignored context element with the new content return domManip( this, arguments, function( elem ) { var parent = this.parentNode; if ( jQuery.inArray( this, ignored ) < 0 ) { jQuery.cleanData( getAll( this ) ); if ( parent ) { parent.replaceChild( elem, this ); } } // Force callback invocation }, ignored ); } } ); jQuery.each( { appendTo: "append", prependTo: "prepend", insertBefore: "before", insertAfter: "after", replaceAll: "replaceWith" }, function( name, original ) { jQuery.fn[ name ] = function( selector ) { var elems, ret = [], insert = jQuery( selector ), last = insert.length - 1, i = 0; for ( ; i <= last; i++ ) { elems = i === last ? this : this.clone( true ); jQuery( insert[ i ] )[ original ]( elems ); // Support: Android <=4.0 only, PhantomJS 1 only // .get() because push.apply(_, arraylike) throws on ancient WebKit push.apply( ret, elems.get() ); } return this.pushStack( ret ); }; } ); var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); var getStyles = function( elem ) { // Support: IE <=11 only, Firefox <=30 (#15098, #14150) // IE throws on elements created in popups // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" var view = elem.ownerDocument.defaultView; if ( !view || !view.opener ) { view = window; } return view.getComputedStyle( elem ); }; var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); ( function() { // Executing both pixelPosition & boxSizingReliable tests require only one layout // so they're executed at the same time to save the second computation. function computeStyleTests() { // This is a singleton, we need to execute it only once if ( !div ) { return; } container.style.cssText = "position:absolute;left:-11111px;width:60px;" + "margin-top:1px;padding:0;border:0"; div.style.cssText = "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + "margin:auto;border:1px;padding:1px;" + "width:60%;top:1%"; documentElement.appendChild( container ).appendChild( div ); var divStyle = window.getComputedStyle( div ); pixelPositionVal = divStyle.top !== "1%"; // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 // Some styles come back with percentage values, even though they shouldn't div.style.right = "60%"; pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; // Support: IE 9 - 11 only // Detect misreporting of content dimensions for box-sizing:border-box elements boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; // Support: IE 9 only // Detect overflow:scroll screwiness (gh-3699) // Support: Chrome <=64 // Don't get tricked when zoom affects offsetWidth (gh-4029) div.style.position = "absolute"; scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; documentElement.removeChild( container ); // Nullify the div so it wouldn't be stored in the memory and // it will also be a sign that checks already performed div = null; } function roundPixelMeasures( measure ) { return Math.round( parseFloat( measure ) ); } var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, reliableMarginLeftVal, container = document.createElement( "div" ), div = document.createElement( "div" ); // Finish early in limited (non-browser) environments if ( !div.style ) { return; } // Support: IE <=9 - 11 only // Style of cloned element affects source element cloned (#8908) div.style.backgroundClip = "content-box"; div.cloneNode( true ).style.backgroundClip = ""; support.clearCloneStyle = div.style.backgroundClip === "content-box"; jQuery.extend( support, { boxSizingReliable: function() { computeStyleTests(); return boxSizingReliableVal; }, pixelBoxStyles: function() { computeStyleTests(); return pixelBoxStylesVal; }, pixelPosition: function() { computeStyleTests(); return pixelPositionVal; }, reliableMarginLeft: function() { computeStyleTests(); return reliableMarginLeftVal; }, scrollboxSize: function() { computeStyleTests(); return scrollboxSizeVal; } } ); } )(); function curCSS( elem, name, computed ) { var width, minWidth, maxWidth, ret, // Support: Firefox 51+ // Retrieving style before computed somehow // fixes an issue with getting wrong values // on detached elements style = elem.style; computed = computed || getStyles( elem ); // getPropertyValue is needed for: // .css('filter') (IE 9 only, #12537) // .css('--customProperty) (#3144) if ( computed ) { ret = computed.getPropertyValue( name ) || computed[ name ]; if ( ret === "" && !isAttached( elem ) ) { ret = jQuery.style( elem, name ); } // A tribute to the "awesome hack by Dean Edwards" // Android Browser returns percentage for some values, // but width seems to be reliably pixels. // This is against the CSSOM draft spec: // https://drafts.csswg.org/cssom/#resolved-values if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { // Remember the original values width = style.width; minWidth = style.minWidth; maxWidth = style.maxWidth; // Put in the new values to get a computed value out style.minWidth = style.maxWidth = style.width = ret; ret = computed.width; // Revert the changed values style.width = width; style.minWidth = minWidth; style.maxWidth = maxWidth; } } return ret !== undefined ? // Support: IE <=9 - 11 only // IE returns zIndex value as an integer. ret + "" : ret; } function addGetHookIf( conditionFn, hookFn ) { // Define the hook, we'll check on the first run if it's really needed. return { get: function() { if ( conditionFn() ) { // Hook not needed (or it's not possible to use it due // to missing dependency), remove it. delete this.get; return; } // Hook needed; redefine it so that the support test is not executed again. return ( this.get = hookFn ).apply( this, arguments ); } }; } var cssPrefixes = [ "Webkit", "Moz", "ms" ], emptyStyle = document.createElement( "div" ).style, vendorProps = {}; // Return a vendor-prefixed property or undefined function vendorPropName( name ) { // Check for vendor prefixed names var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), i = cssPrefixes.length; while ( i-- ) { name = cssPrefixes[ i ] + capName; if ( name in emptyStyle ) { return name; } } } // Return a potentially-mapped jQuery.cssProps or vendor prefixed property function finalPropName( name ) { var final = jQuery.cssProps[ name ] || vendorProps[ name ]; if ( final ) { return final; } if ( name in emptyStyle ) { return name; } return vendorProps[ name ] = vendorPropName( name ) || name; } var // Swappable if display is none or starts with table // except "table", "table-cell", or "table-caption" // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display rdisplayswap = /^(none|table(?!-c[ea]).+)/, rcustomProp = /^--/, cssShow = { position: "absolute", visibility: "hidden", display: "block" }, cssNormalTransform = { letterSpacing: "0", fontWeight: "400" }; function setPositiveNumber( elem, value, subtract ) { // Any relative (+/-) values have already been // normalized at this point var matches = rcssNum.exec( value ); return matches ? // Guard against undefined "subtract", e.g., when used as in cssHooks Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : value; } function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { var i = dimension === "width" ? 1 : 0, extra = 0, delta = 0; // Adjustment may not be necessary if ( box === ( isBorderBox ? "border" : "content" ) ) { return 0; } for ( ; i < 4; i += 2 ) { // Both box models exclude margin if ( box === "margin" ) { delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); } // If we get here with a content-box, we're seeking "padding" or "border" or "margin" if ( !isBorderBox ) { // Add padding delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); // For "border" or "margin", add border if ( box !== "padding" ) { delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); // But still keep track of it otherwise } else { extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); } // If we get here with a border-box (content + padding + border), we're seeking "content" or // "padding" or "margin" } else { // For "content", subtract padding if ( box === "content" ) { delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); } // For "content" or "padding", subtract border if ( box !== "margin" ) { delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); } } } // Account for positive content-box scroll gutter when requested by providing computedVal if ( !isBorderBox && computedVal >= 0 ) { // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border // Assuming integer scroll gutter, subtract the rest and round down delta += Math.max( 0, Math.ceil( elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - computedVal - delta - extra - 0.5 // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter // Use an explicit zero to avoid NaN (gh-3964) ) ) || 0; } return delta; } function getWidthOrHeight( elem, dimension, extra ) { // Start with computed style var styles = getStyles( elem ), // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). // Fake content-box until we know it's needed to know the true value. boxSizingNeeded = !support.boxSizingReliable() || extra, isBorderBox = boxSizingNeeded && jQuery.css( elem, "boxSizing", false, styles ) === "border-box", valueIsBorderBox = isBorderBox, val = curCSS( elem, dimension, styles ), offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); // Support: Firefox <=54 // Return a confounding non-pixel value or feign ignorance, as appropriate. if ( rnumnonpx.test( val ) ) { if ( !extra ) { return val; } val = "auto"; } // Fall back to offsetWidth/offsetHeight when value is "auto" // This happens for inline elements with no explicit setting (gh-3571) // Support: Android <=4.1 - 4.3 only // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) // Support: IE 9-11 only // Also use offsetWidth/offsetHeight for when box sizing is unreliable // We use getClientRects() to check for hidden/disconnected. // In those cases, the computed value can be trusted to be border-box if ( ( !support.boxSizingReliable() && isBorderBox || val === "auto" || !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && elem.getClientRects().length ) { isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; // Where available, offsetWidth/offsetHeight approximate border box dimensions. // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the // retrieved value as a content box dimension. valueIsBorderBox = offsetProp in elem; if ( valueIsBorderBox ) { val = elem[ offsetProp ]; } } // Normalize "" and auto val = parseFloat( val ) || 0; // Adjust for the element's box model return ( val + boxModelAdjustment( elem, dimension, extra || ( isBorderBox ? "border" : "content" ), valueIsBorderBox, styles, // Provide the current computed size to request scroll gutter calculation (gh-3589) val ) ) + "px"; } jQuery.extend( { // Add in style property hooks for overriding the default // behavior of getting and setting a style property cssHooks: { opacity: { get: function( elem, computed ) { if ( computed ) { // We should always get a number back from opacity var ret = curCSS( elem, "opacity" ); return ret === "" ? "1" : ret; } } } }, // Don't automatically add "px" to these possibly-unitless properties cssNumber: { "animationIterationCount": true, "columnCount": true, "fillOpacity": true, "flexGrow": true, "flexShrink": true, "fontWeight": true, "gridArea": true, "gridColumn": true, "gridColumnEnd": true, "gridColumnStart": true, "gridRow": true, "gridRowEnd": true, "gridRowStart": true, "lineHeight": true, "opacity": true, "order": true, "orphans": true, "widows": true, "zIndex": true, "zoom": true }, // Add in properties whose names you wish to fix before // setting or getting the value cssProps: {}, // Get and set the style property on a DOM Node style: function( elem, name, value, extra ) { // Don't set styles on text and comment nodes if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { return; } // Make sure that we're working with the right name var ret, type, hooks, origName = camelCase( name ), isCustomProp = rcustomProp.test( name ), style = elem.style; // Make sure that we're working with the right name. We don't // want to query the value if it is a CSS custom property // since they are user-defined. if ( !isCustomProp ) { name = finalPropName( origName ); } // Gets hook for the prefixed version, then unprefixed version hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; // Check if we're setting a value if ( value !== undefined ) { type = typeof value; // Convert "+=" or "-=" to relative numbers (#7345) if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { value = adjustCSS( elem, name, ret ); // Fixes bug #9237 type = "number"; } // Make sure that null and NaN values aren't set (#7116) if ( value == null || value !== value ) { return; } // If a number was passed in, add the unit (except for certain CSS properties) // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append // "px" to a few hardcoded values. if ( type === "number" && !isCustomProp ) { value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); } // background-* props affect original clone's values if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { style[ name ] = "inherit"; } // If a hook was provided, use that value, otherwise just set the specified value if ( !hooks || !( "set" in hooks ) || ( value = hooks.set( elem, value, extra ) ) !== undefined ) { if ( isCustomProp ) { style.setProperty( name, value ); } else { style[ name ] = value; } } } else { // If a hook was provided get the non-computed value from there if ( hooks && "get" in hooks && ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { return ret; } // Otherwise just get the value from the style object return style[ name ]; } }, css: function( elem, name, extra, styles ) { var val, num, hooks, origName = camelCase( name ), isCustomProp = rcustomProp.test( name ); // Make sure that we're working with the right name. We don't // want to modify the value if it is a CSS custom property // since they are user-defined. if ( !isCustomProp ) { name = finalPropName( origName ); } // Try prefixed name followed by the unprefixed name hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; // If a hook was provided get the computed value from there if ( hooks && "get" in hooks ) { val = hooks.get( elem, true, extra ); } // Otherwise, if a way to get the computed value exists, use that if ( val === undefined ) { val = curCSS( elem, name, styles ); } // Convert "normal" to computed value if ( val === "normal" && name in cssNormalTransform ) { val = cssNormalTransform[ name ]; } // Make numeric if forced or a qualifier was provided and val looks numeric if ( extra === "" || extra ) { num = parseFloat( val ); return extra === true || isFinite( num ) ? num || 0 : val; } return val; } } ); jQuery.each( [ "height", "width" ], function( i, dimension ) { jQuery.cssHooks[ dimension ] = { get: function( elem, computed, extra ) { if ( computed ) { // Certain elements can have dimension info if we invisibly show them // but it must have a current display style that would benefit return rdisplayswap.test( jQuery.css( elem, "display" ) ) && // Support: Safari 8+ // Table columns in Safari have non-zero offsetWidth & zero // getBoundingClientRect().width unless display is changed. // Support: IE <=11 only // Running getBoundingClientRect on a disconnected node // in IE throws an error. ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? swap( elem, cssShow, function() { return getWidthOrHeight( elem, dimension, extra ); } ) : getWidthOrHeight( elem, dimension, extra ); } }, set: function( elem, value, extra ) { var matches, styles = getStyles( elem ), // Only read styles.position if the test has a chance to fail // to avoid forcing a reflow. scrollboxSizeBuggy = !support.scrollboxSize() && styles.position === "absolute", // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) boxSizingNeeded = scrollboxSizeBuggy || extra, isBorderBox = boxSizingNeeded && jQuery.css( elem, "boxSizing", false, styles ) === "border-box", subtract = extra ? boxModelAdjustment( elem, dimension, extra, isBorderBox, styles ) : 0; // Account for unreliable border-box dimensions by comparing offset* to computed and // faking a content-box to get border and padding (gh-3699) if ( isBorderBox && scrollboxSizeBuggy ) { subtract -= Math.ceil( elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - parseFloat( styles[ dimension ] ) - boxModelAdjustment( elem, dimension, "border", false, styles ) - 0.5 ); } // Convert to pixels if value adjustment is needed if ( subtract && ( matches = rcssNum.exec( value ) ) && ( matches[ 3 ] || "px" ) !== "px" ) { elem.style[ dimension ] = value; value = jQuery.css( elem, dimension ); } return setPositiveNumber( elem, value, subtract ); } }; } ); jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, function( elem, computed ) { if ( computed ) { return ( parseFloat( curCSS( elem, "marginLeft" ) ) || elem.getBoundingClientRect().left - swap( elem, { marginLeft: 0 }, function() { return elem.getBoundingClientRect().left; } ) ) + "px"; } } ); // These hooks are used by animate to expand properties jQuery.each( { margin: "", padding: "", border: "Width" }, function( prefix, suffix ) { jQuery.cssHooks[ prefix + suffix ] = { expand: function( value ) { var i = 0, expanded = {}, // Assumes a single number if not a string parts = typeof value === "string" ? value.split( " " ) : [ value ]; for ( ; i < 4; i++ ) { expanded[ prefix + cssExpand[ i ] + suffix ] = parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; } return expanded; } }; if ( prefix !== "margin" ) { jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; } } ); jQuery.fn.extend( { css: function( name, value ) { return access( this, function( elem, name, value ) { var styles, len, map = {}, i = 0; if ( Array.isArray( name ) ) { styles = getStyles( elem ); len = name.length; for ( ; i < len; i++ ) { map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); } return map; } return value !== undefined ? jQuery.style( elem, name, value ) : jQuery.css( elem, name ); }, name, value, arguments.length > 1 ); } } ); function Tween( elem, options, prop, end, easing ) { return new Tween.prototype.init( elem, options, prop, end, easing ); } jQuery.Tween = Tween; Tween.prototype = { constructor: Tween, init: function( elem, options, prop, end, easing, unit ) { this.elem = elem; this.prop = prop; this.easing = easing || jQuery.easing._default; this.options = options; this.start = this.now = this.cur(); this.end = end; this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); }, cur: function() { var hooks = Tween.propHooks[ this.prop ]; return hooks && hooks.get ? hooks.get( this ) : Tween.propHooks._default.get( this ); }, run: function( percent ) { var eased, hooks = Tween.propHooks[ this.prop ]; if ( this.options.duration ) { this.pos = eased = jQuery.easing[ this.easing ]( percent, this.options.duration * percent, 0, 1, this.options.duration ); } else { this.pos = eased = percent; } this.now = ( this.end - this.start ) * eased + this.start; if ( this.options.step ) { this.options.step.call( this.elem, this.now, this ); } if ( hooks && hooks.set ) { hooks.set( this ); } else { Tween.propHooks._default.set( this ); } return this; } }; Tween.prototype.init.prototype = Tween.prototype; Tween.propHooks = { _default: { get: function( tween ) { var result; // Use a property on the element directly when it is not a DOM element, // or when there is no matching style property that exists. if ( tween.elem.nodeType !== 1 || tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { return tween.elem[ tween.prop ]; } // Passing an empty string as a 3rd parameter to .css will automatically // attempt a parseFloat and fallback to a string if the parse fails. // Simple values such as "10px" are parsed to Float; // complex values such as "rotate(1rad)" are returned as-is. result = jQuery.css( tween.elem, tween.prop, "" ); // Empty strings, null, undefined and "auto" are converted to 0. return !result || result === "auto" ? 0 : result; }, set: function( tween ) { // Use step hook for back compat. // Use cssHook if its there. // Use .style if available and use plain properties where available. if ( jQuery.fx.step[ tween.prop ] ) { jQuery.fx.step[ tween.prop ]( tween ); } else if ( tween.elem.nodeType === 1 && ( jQuery.cssHooks[ tween.prop ] || tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); } else { tween.elem[ tween.prop ] = tween.now; } } } }; // Support: IE <=9 only // Panic based approach to setting things on disconnected nodes Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { set: function( tween ) { if ( tween.elem.nodeType && tween.elem.parentNode ) { tween.elem[ tween.prop ] = tween.now; } } }; jQuery.easing = { linear: function( p ) { return p; }, swing: function( p ) { return 0.5 - Math.cos( p * Math.PI ) / 2; }, _default: "swing" }; jQuery.fx = Tween.prototype.init; // Back compat <1.8 extension point jQuery.fx.step = {}; var fxNow, inProgress, rfxtypes = /^(?:toggle|show|hide)$/, rrun = /queueHooks$/; function schedule() { if ( inProgress ) { if ( document.hidden === false && window.requestAnimationFrame ) { window.requestAnimationFrame( schedule ); } else { window.setTimeout( schedule, jQuery.fx.interval ); } jQuery.fx.tick(); } } // Animations created synchronously will run synchronously function createFxNow() { window.setTimeout( function() { fxNow = undefined; } ); return ( fxNow = Date.now() ); } // Generate parameters to create a standard animation function genFx( type, includeWidth ) { var which, i = 0, attrs = { height: type }; // If we include width, step value is 1 to do all cssExpand values, // otherwise step value is 2 to skip over Left and Right includeWidth = includeWidth ? 1 : 0; for ( ; i < 4; i += 2 - includeWidth ) { which = cssExpand[ i ]; attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; } if ( includeWidth ) { attrs.opacity = attrs.width = type; } return attrs; } function createTween( value, prop, animation ) { var tween, collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), index = 0, length = collection.length; for ( ; index < length; index++ ) { if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { // We're done with this property return tween; } } } function defaultPrefilter( elem, props, opts ) { var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, isBox = "width" in props || "height" in props, anim = this, orig = {}, style = elem.style, hidden = elem.nodeType && isHiddenWithinTree( elem ), dataShow = dataPriv.get( elem, "fxshow" ); // Queue-skipping animations hijack the fx hooks if ( !opts.queue ) { hooks = jQuery._queueHooks( elem, "fx" ); if ( hooks.unqueued == null ) { hooks.unqueued = 0; oldfire = hooks.empty.fire; hooks.empty.fire = function() { if ( !hooks.unqueued ) { oldfire(); } }; } hooks.unqueued++; anim.always( function() { // Ensure the complete handler is called before this completes anim.always( function() { hooks.unqueued--; if ( !jQuery.queue( elem, "fx" ).length ) { hooks.empty.fire(); } } ); } ); } // Detect show/hide animations for ( prop in props ) { value = props[ prop ]; if ( rfxtypes.test( value ) ) { delete props[ prop ]; toggle = toggle || value === "toggle"; if ( value === ( hidden ? "hide" : "show" ) ) { // Pretend to be hidden if this is a "show" and // there is still data from a stopped show/hide if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { hidden = true; // Ignore all other no-op show/hide data } else { continue; } } orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); } } // Bail out if this is a no-op like .hide().hide() propTween = !jQuery.isEmptyObject( props ); if ( !propTween && jQuery.isEmptyObject( orig ) ) { return; } // Restrict "overflow" and "display" styles during box animations if ( isBox && elem.nodeType === 1 ) { // Support: IE <=9 - 11, Edge 12 - 15 // Record all 3 overflow attributes because IE does not infer the shorthand // from identically-valued overflowX and overflowY and Edge just mirrors // the overflowX value there. opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; // Identify a display type, preferring old show/hide data over the CSS cascade restoreDisplay = dataShow && dataShow.display; if ( restoreDisplay == null ) { restoreDisplay = dataPriv.get( elem, "display" ); } display = jQuery.css( elem, "display" ); if ( display === "none" ) { if ( restoreDisplay ) { display = restoreDisplay; } else { // Get nonempty value(s) by temporarily forcing visibility showHide( [ elem ], true ); restoreDisplay = elem.style.display || restoreDisplay; display = jQuery.css( elem, "display" ); showHide( [ elem ] ); } } // Animate inline elements as inline-block if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { if ( jQuery.css( elem, "float" ) === "none" ) { // Restore the original display value at the end of pure show/hide animations if ( !propTween ) { anim.done( function() { style.display = restoreDisplay; } ); if ( restoreDisplay == null ) { display = style.display; restoreDisplay = display === "none" ? "" : display; } } style.display = "inline-block"; } } } if ( opts.overflow ) { style.overflow = "hidden"; anim.always( function() { style.overflow = opts.overflow[ 0 ]; style.overflowX = opts.overflow[ 1 ]; style.overflowY = opts.overflow[ 2 ]; } ); } // Implement show/hide animations propTween = false; for ( prop in orig ) { // General show/hide setup for this element animation if ( !propTween ) { if ( dataShow ) { if ( "hidden" in dataShow ) { hidden = dataShow.hidden; } } else { dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); } // Store hidden/visible for toggle so `.stop().toggle()` "reverses" if ( toggle ) { dataShow.hidden = !hidden; } // Show elements before animating them if ( hidden ) { showHide( [ elem ], true ); } /* eslint-disable no-loop-func */ anim.done( function() { /* eslint-enable no-loop-func */ // The final step of a "hide" animation is actually hiding the element if ( !hidden ) { showHide( [ elem ] ); } dataPriv.remove( elem, "fxshow" ); for ( prop in orig ) { jQuery.style( elem, prop, orig[ prop ] ); } } ); } // Per-property setup propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); if ( !( prop in dataShow ) ) { dataShow[ prop ] = propTween.start; if ( hidden ) { propTween.end = propTween.start; propTween.start = 0; } } } } function propFilter( props, specialEasing ) { var index, name, easing, value, hooks; // camelCase, specialEasing and expand cssHook pass for ( index in props ) { name = camelCase( index ); easing = specialEasing[ name ]; value = props[ index ]; if ( Array.isArray( value ) ) { easing = value[ 1 ]; value = props[ index ] = value[ 0 ]; } if ( index !== name ) { props[ name ] = value; delete props[ index ]; } hooks = jQuery.cssHooks[ name ]; if ( hooks && "expand" in hooks ) { value = hooks.expand( value ); delete props[ name ]; // Not quite $.extend, this won't overwrite existing keys. // Reusing 'index' because we have the correct "name" for ( index in value ) { if ( !( index in props ) ) { props[ index ] = value[ index ]; specialEasing[ index ] = easing; } } } else { specialEasing[ name ] = easing; } } } function Animation( elem, properties, options ) { var result, stopped, index = 0, length = Animation.prefilters.length, deferred = jQuery.Deferred().always( function() { // Don't match elem in the :animated selector delete tick.elem; } ), tick = function() { if ( stopped ) { return false; } var currentTime = fxNow || createFxNow(), remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), // Support: Android 2.3 only // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) temp = remaining / animation.duration || 0, percent = 1 - temp, index = 0, length = animation.tweens.length; for ( ; index < length; index++ ) { animation.tweens[ index ].run( percent ); } deferred.notifyWith( elem, [ animation, percent, remaining ] ); // If there's more to do, yield if ( percent < 1 && length ) { return remaining; } // If this was an empty animation, synthesize a final progress notification if ( !length ) { deferred.notifyWith( elem, [ animation, 1, 0 ] ); } // Resolve the animation and report its conclusion deferred.resolveWith( elem, [ animation ] ); return false; }, animation = deferred.promise( { elem: elem, props: jQuery.extend( {}, properties ), opts: jQuery.extend( true, { specialEasing: {}, easing: jQuery.easing._default }, options ), originalProperties: properties, originalOptions: options, startTime: fxNow || createFxNow(), duration: options.duration, tweens: [], createTween: function( prop, end ) { var tween = jQuery.Tween( elem, animation.opts, prop, end, animation.opts.specialEasing[ prop ] || animation.opts.easing ); animation.tweens.push( tween ); return tween; }, stop: function( gotoEnd ) { var index = 0, // If we are going to the end, we want to run all the tweens // otherwise we skip this part length = gotoEnd ? animation.tweens.length : 0; if ( stopped ) { return this; } stopped = true; for ( ; index < length; index++ ) { animation.tweens[ index ].run( 1 ); } // Resolve when we played the last frame; otherwise, reject if ( gotoEnd ) { deferred.notifyWith( elem, [ animation, 1, 0 ] ); deferred.resolveWith( elem, [ animation, gotoEnd ] ); } else { deferred.rejectWith( elem, [ animation, gotoEnd ] ); } return this; } } ), props = animation.props; propFilter( props, animation.opts.specialEasing ); for ( ; index < length; index++ ) { result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); if ( result ) { if ( isFunction( result.stop ) ) { jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = result.stop.bind( result ); } return result; } } jQuery.map( props, createTween, animation ); if ( isFunction( animation.opts.start ) ) { animation.opts.start.call( elem, animation ); } // Attach callbacks from options animation .progress( animation.opts.progress ) .done( animation.opts.done, animation.opts.complete ) .fail( animation.opts.fail ) .always( animation.opts.always ); jQuery.fx.timer( jQuery.extend( tick, { elem: elem, anim: animation, queue: animation.opts.queue } ) ); return animation; } jQuery.Animation = jQuery.extend( Animation, { tweeners: { "*": [ function( prop, value ) { var tween = this.createTween( prop, value ); adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); return tween; } ] }, tweener: function( props, callback ) { if ( isFunction( props ) ) { callback = props; props = [ "*" ]; } else { props = props.match( rnothtmlwhite ); } var prop, index = 0, length = props.length; for ( ; index < length; index++ ) { prop = props[ index ]; Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; Animation.tweeners[ prop ].unshift( callback ); } }, prefilters: [ defaultPrefilter ], prefilter: function( callback, prepend ) { if ( prepend ) { Animation.prefilters.unshift( callback ); } else { Animation.prefilters.push( callback ); } } } ); jQuery.speed = function( speed, easing, fn ) { var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { complete: fn || !fn && easing || isFunction( speed ) && speed, duration: speed, easing: fn && easing || easing && !isFunction( easing ) && easing }; // Go to the end state if fx are off if ( jQuery.fx.off ) { opt.duration = 0; } else { if ( typeof opt.duration !== "number" ) { if ( opt.duration in jQuery.fx.speeds ) { opt.duration = jQuery.fx.speeds[ opt.duration ]; } else { opt.duration = jQuery.fx.speeds._default; } } } // Normalize opt.queue - true/undefined/null -> "fx" if ( opt.queue == null || opt.queue === true ) { opt.queue = "fx"; } // Queueing opt.old = opt.complete; opt.complete = function() { if ( isFunction( opt.old ) ) { opt.old.call( this ); } if ( opt.queue ) { jQuery.dequeue( this, opt.queue ); } }; return opt; }; jQuery.fn.extend( { fadeTo: function( speed, to, easing, callback ) { // Show any hidden elements after setting opacity to 0 return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() // Animate to the value specified .end().animate( { opacity: to }, speed, easing, callback ); }, animate: function( prop, speed, easing, callback ) { var empty = jQuery.isEmptyObject( prop ), optall = jQuery.speed( speed, easing, callback ), doAnimation = function() { // Operate on a copy of prop so per-property easing won't be lost var anim = Animation( this, jQuery.extend( {}, prop ), optall ); // Empty animations, or finishing resolves immediately if ( empty || dataPriv.get( this, "finish" ) ) { anim.stop( true ); } }; doAnimation.finish = doAnimation; return empty || optall.queue === false ? this.each( doAnimation ) : this.queue( optall.queue, doAnimation ); }, stop: function( type, clearQueue, gotoEnd ) { var stopQueue = function( hooks ) { var stop = hooks.stop; delete hooks.stop; stop( gotoEnd ); }; if ( typeof type !== "string" ) { gotoEnd = clearQueue; clearQueue = type; type = undefined; } if ( clearQueue && type !== false ) { this.queue( type || "fx", [] ); } return this.each( function() { var dequeue = true, index = type != null && type + "queueHooks", timers = jQuery.timers, data = dataPriv.get( this ); if ( index ) { if ( data[ index ] && data[ index ].stop ) { stopQueue( data[ index ] ); } } else { for ( index in data ) { if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { stopQueue( data[ index ] ); } } } for ( index = timers.length; index--; ) { if ( timers[ index ].elem === this && ( type == null || timers[ index ].queue === type ) ) { timers[ index ].anim.stop( gotoEnd ); dequeue = false; timers.splice( index, 1 ); } } // Start the next in the queue if the last step wasn't forced. // Timers currently will call their complete callbacks, which // will dequeue but only if they were gotoEnd. if ( dequeue || !gotoEnd ) { jQuery.dequeue( this, type ); } } ); }, finish: function( type ) { if ( type !== false ) { type = type || "fx"; } return this.each( function() { var index, data = dataPriv.get( this ), queue = data[ type + "queue" ], hooks = data[ type + "queueHooks" ], timers = jQuery.timers, length = queue ? queue.length : 0; // Enable finishing flag on private data data.finish = true; // Empty the queue first jQuery.queue( this, type, [] ); if ( hooks && hooks.stop ) { hooks.stop.call( this, true ); } // Look for any active animations, and finish them for ( index = timers.length; index--; ) { if ( timers[ index ].elem === this && timers[ index ].queue === type ) { timers[ index ].anim.stop( true ); timers.splice( index, 1 ); } } // Look for any animations in the old queue and finish them for ( index = 0; index < length; index++ ) { if ( queue[ index ] && queue[ index ].finish ) { queue[ index ].finish.call( this ); } } // Turn off finishing flag delete data.finish; } ); } } ); jQuery.each( [ "toggle", "show", "hide" ], function( i, name ) { var cssFn = jQuery.fn[ name ]; jQuery.fn[ name ] = function( speed, easing, callback ) { return speed == null || typeof speed === "boolean" ? cssFn.apply( this, arguments ) : this.animate( genFx( name, true ), speed, easing, callback ); }; } ); // Generate shortcuts for custom animations jQuery.each( { slideDown: genFx( "show" ), slideUp: genFx( "hide" ), slideToggle: genFx( "toggle" ), fadeIn: { opacity: "show" }, fadeOut: { opacity: "hide" }, fadeToggle: { opacity: "toggle" } }, function( name, props ) { jQuery.fn[ name ] = function( speed, easing, callback ) { return this.animate( props, speed, easing, callback ); }; } ); jQuery.timers = []; jQuery.fx.tick = function() { var timer, i = 0, timers = jQuery.timers; fxNow = Date.now(); for ( ; i < timers.length; i++ ) { timer = timers[ i ]; // Run the timer and safely remove it when done (allowing for external removal) if ( !timer() && timers[ i ] === timer ) { timers.splice( i--, 1 ); } } if ( !timers.length ) { jQuery.fx.stop(); } fxNow = undefined; }; jQuery.fx.timer = function( timer ) { jQuery.timers.push( timer ); jQuery.fx.start(); }; jQuery.fx.interval = 13; jQuery.fx.start = function() { if ( inProgress ) { return; } inProgress = true; schedule(); }; jQuery.fx.stop = function() { inProgress = null; }; jQuery.fx.speeds = { slow: 600, fast: 200, // Default speed _default: 400 }; // Based off of the plugin by Clint Helfers, with permission. // https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ jQuery.fn.delay = function( time, type ) { time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; type = type || "fx"; return this.queue( type, function( next, hooks ) { var timeout = window.setTimeout( next, time ); hooks.stop = function() { window.clearTimeout( timeout ); }; } ); }; ( function() { var input = document.createElement( "input" ), select = document.createElement( "select" ), opt = select.appendChild( document.createElement( "option" ) ); input.type = "checkbox"; // Support: Android <=4.3 only // Default value for a checkbox should be "on" support.checkOn = input.value !== ""; // Support: IE <=11 only // Must access selectedIndex to make default options select support.optSelected = opt.selected; // Support: IE <=11 only // An input loses its value after becoming a radio input = document.createElement( "input" ); input.value = "t"; input.type = "radio"; support.radioValue = input.value === "t"; } )(); var boolHook, attrHandle = jQuery.expr.attrHandle; jQuery.fn.extend( { attr: function( name, value ) { return access( this, jQuery.attr, name, value, arguments.length > 1 ); }, removeAttr: function( name ) { return this.each( function() { jQuery.removeAttr( this, name ); } ); } } ); jQuery.extend( { attr: function( elem, name, value ) { var ret, hooks, nType = elem.nodeType; // Don't get/set attributes on text, comment and attribute nodes if ( nType === 3 || nType === 8 || nType === 2 ) { return; } // Fallback to prop when attributes are not supported if ( typeof elem.getAttribute === "undefined" ) { return jQuery.prop( elem, name, value ); } // Attribute hooks are determined by the lowercase version // Grab necessary hook if one is defined if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { hooks = jQuery.attrHooks[ name.toLowerCase() ] || ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); } if ( value !== undefined ) { if ( value === null ) { jQuery.removeAttr( elem, name ); return; } if ( hooks && "set" in hooks && ( ret = hooks.set( elem, value, name ) ) !== undefined ) { return ret; } elem.setAttribute( name, value + "" ); return value; } if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { return ret; } ret = jQuery.find.attr( elem, name ); // Non-existent attributes return null, we normalize to undefined return ret == null ? undefined : ret; }, attrHooks: { type: { set: function( elem, value ) { if ( !support.radioValue && value === "radio" && nodeName( elem, "input" ) ) { var val = elem.value; elem.setAttribute( "type", value ); if ( val ) { elem.value = val; } return value; } } } }, removeAttr: function( elem, value ) { var name, i = 0, // Attribute names can contain non-HTML whitespace characters // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 attrNames = value && value.match( rnothtmlwhite ); if ( attrNames && elem.nodeType === 1 ) { while ( ( name = attrNames[ i++ ] ) ) { elem.removeAttribute( name ); } } } } ); // Hooks for boolean attributes boolHook = { set: function( elem, value, name ) { if ( value === false ) { // Remove boolean attributes when set to false jQuery.removeAttr( elem, name ); } else { elem.setAttribute( name, name ); } return name; } }; jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( i, name ) { var getter = attrHandle[ name ] || jQuery.find.attr; attrHandle[ name ] = function( elem, name, isXML ) { var ret, handle, lowercaseName = name.toLowerCase(); if ( !isXML ) { // Avoid an infinite loop by temporarily removing this function from the getter handle = attrHandle[ lowercaseName ]; attrHandle[ lowercaseName ] = ret; ret = getter( elem, name, isXML ) != null ? lowercaseName : null; attrHandle[ lowercaseName ] = handle; } return ret; }; } ); var rfocusable = /^(?:input|select|textarea|button)$/i, rclickable = /^(?:a|area)$/i; jQuery.fn.extend( { prop: function( name, value ) { return access( this, jQuery.prop, name, value, arguments.length > 1 ); }, removeProp: function( name ) { return this.each( function() { delete this[ jQuery.propFix[ name ] || name ]; } ); } } ); jQuery.extend( { prop: function( elem, name, value ) { var ret, hooks, nType = elem.nodeType; // Don't get/set properties on text, comment and attribute nodes if ( nType === 3 || nType === 8 || nType === 2 ) { return; } if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { // Fix name and attach hooks name = jQuery.propFix[ name ] || name; hooks = jQuery.propHooks[ name ]; } if ( value !== undefined ) { if ( hooks && "set" in hooks && ( ret = hooks.set( elem, value, name ) ) !== undefined ) { return ret; } return ( elem[ name ] = value ); } if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { return ret; } return elem[ name ]; }, propHooks: { tabIndex: { get: function( elem ) { // Support: IE <=9 - 11 only // elem.tabIndex doesn't always return the // correct value when it hasn't been explicitly set // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ // Use proper attribute retrieval(#12072) var tabindex = jQuery.find.attr( elem, "tabindex" ); if ( tabindex ) { return parseInt( tabindex, 10 ); } if ( rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ) { return 0; } return -1; } } }, propFix: { "for": "htmlFor", "class": "className" } } ); // Support: IE <=11 only // Accessing the selectedIndex property // forces the browser to respect setting selected // on the option // The getter ensures a default option is selected // when in an optgroup // eslint rule "no-unused-expressions" is disabled for this code // since it considers such accessions noop if ( !support.optSelected ) { jQuery.propHooks.selected = { get: function( elem ) { /* eslint no-unused-expressions: "off" */ var parent = elem.parentNode; if ( parent && parent.parentNode ) { parent.parentNode.selectedIndex; } return null; }, set: function( elem ) { /* eslint no-unused-expressions: "off" */ var parent = elem.parentNode; if ( parent ) { parent.selectedIndex; if ( parent.parentNode ) { parent.parentNode.selectedIndex; } } } }; } jQuery.each( [ "tabIndex", "readOnly", "maxLength", "cellSpacing", "cellPadding", "rowSpan", "colSpan", "useMap", "frameBorder", "contentEditable" ], function() { jQuery.propFix[ this.toLowerCase() ] = this; } ); // Strip and collapse whitespace according to HTML spec // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace function stripAndCollapse( value ) { var tokens = value.match( rnothtmlwhite ) || []; return tokens.join( " " ); } function getClass( elem ) { return elem.getAttribute && elem.getAttribute( "class" ) || ""; } function classesToArray( value ) { if ( Array.isArray( value ) ) { return value; } if ( typeof value === "string" ) { return value.match( rnothtmlwhite ) || []; } return []; } jQuery.fn.extend( { addClass: function( value ) { var classes, elem, cur, curValue, clazz, j, finalValue, i = 0; if ( isFunction( value ) ) { return this.each( function( j ) { jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); } ); } classes = classesToArray( value ); if ( classes.length ) { while ( ( elem = this[ i++ ] ) ) { curValue = getClass( elem ); cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); if ( cur ) { j = 0; while ( ( clazz = classes[ j++ ] ) ) { if ( cur.indexOf( " " + clazz + " " ) < 0 ) { cur += clazz + " "; } } // Only assign if different to avoid unneeded rendering. finalValue = stripAndCollapse( cur ); if ( curValue !== finalValue ) { elem.setAttribute( "class", finalValue ); } } } } return this; }, removeClass: function( value ) { var classes, elem, cur, curValue, clazz, j, finalValue, i = 0; if ( isFunction( value ) ) { return this.each( function( j ) { jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); } ); } if ( !arguments.length ) { return this.attr( "class", "" ); } classes = classesToArray( value ); if ( classes.length ) { while ( ( elem = this[ i++ ] ) ) { curValue = getClass( elem ); // This expression is here for better compressibility (see addClass) cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); if ( cur ) { j = 0; while ( ( clazz = classes[ j++ ] ) ) { // Remove *all* instances while ( cur.indexOf( " " + clazz + " " ) > -1 ) { cur = cur.replace( " " + clazz + " ", " " ); } } // Only assign if different to avoid unneeded rendering. finalValue = stripAndCollapse( cur ); if ( curValue !== finalValue ) { elem.setAttribute( "class", finalValue ); } } } } return this; }, toggleClass: function( value, stateVal ) { var type = typeof value, isValidValue = type === "string" || Array.isArray( value ); if ( typeof stateVal === "boolean" && isValidValue ) { return stateVal ? this.addClass( value ) : this.removeClass( value ); } if ( isFunction( value ) ) { return this.each( function( i ) { jQuery( this ).toggleClass( value.call( this, i, getClass( this ), stateVal ), stateVal ); } ); } return this.each( function() { var className, i, self, classNames; if ( isValidValue ) { // Toggle individual class names i = 0; self = jQuery( this ); classNames = classesToArray( value ); while ( ( className = classNames[ i++ ] ) ) { // Check each className given, space separated list if ( self.hasClass( className ) ) { self.removeClass( className ); } else { self.addClass( className ); } } // Toggle whole class name } else if ( value === undefined || type === "boolean" ) { className = getClass( this ); if ( className ) { // Store className if set dataPriv.set( this, "__className__", className ); } // If the element has a class name or if we're passed `false`, // then remove the whole classname (if there was one, the above saved it). // Otherwise bring back whatever was previously saved (if anything), // falling back to the empty string if nothing was stored. if ( this.setAttribute ) { this.setAttribute( "class", className || value === false ? "" : dataPriv.get( this, "__className__" ) || "" ); } } } ); }, hasClass: function( selector ) { var className, elem, i = 0; className = " " + selector + " "; while ( ( elem = this[ i++ ] ) ) { if ( elem.nodeType === 1 && ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { return true; } } return false; } } ); var rreturn = /\r/g; jQuery.fn.extend( { val: function( value ) { var hooks, ret, valueIsFunction, elem = this[ 0 ]; if ( !arguments.length ) { if ( elem ) { hooks = jQuery.valHooks[ elem.type ] || jQuery.valHooks[ elem.nodeName.toLowerCase() ]; if ( hooks && "get" in hooks && ( ret = hooks.get( elem, "value" ) ) !== undefined ) { return ret; } ret = elem.value; // Handle most common string cases if ( typeof ret === "string" ) { return ret.replace( rreturn, "" ); } // Handle cases where value is null/undef or number return ret == null ? "" : ret; } return; } valueIsFunction = isFunction( value ); return this.each( function( i ) { var val; if ( this.nodeType !== 1 ) { return; } if ( valueIsFunction ) { val = value.call( this, i, jQuery( this ).val() ); } else { val = value; } // Treat null/undefined as ""; convert numbers to string if ( val == null ) { val = ""; } else if ( typeof val === "number" ) { val += ""; } else if ( Array.isArray( val ) ) { val = jQuery.map( val, function( value ) { return value == null ? "" : value + ""; } ); } hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; // If set returns undefined, fall back to normal setting if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { this.value = val; } } ); } } ); jQuery.extend( { valHooks: { option: { get: function( elem ) { var val = jQuery.find.attr( elem, "value" ); return val != null ? val : // Support: IE <=10 - 11 only // option.text throws exceptions (#14686, #14858) // Strip and collapse whitespace // https://html.spec.whatwg.org/#strip-and-collapse-whitespace stripAndCollapse( jQuery.text( elem ) ); } }, select: { get: function( elem ) { var value, option, i, options = elem.options, index = elem.selectedIndex, one = elem.type === "select-one", values = one ? null : [], max = one ? index + 1 : options.length; if ( index < 0 ) { i = max; } else { i = one ? index : 0; } // Loop through all the selected options for ( ; i < max; i++ ) { option = options[ i ]; // Support: IE <=9 only // IE8-9 doesn't update selected after form reset (#2551) if ( ( option.selected || i === index ) && // Don't return options that are disabled or in a disabled optgroup !option.disabled && ( !option.parentNode.disabled || !nodeName( option.parentNode, "optgroup" ) ) ) { // Get the specific value for the option value = jQuery( option ).val(); // We don't need an array for one selects if ( one ) { return value; } // Multi-Selects return an array values.push( value ); } } return values; }, set: function( elem, value ) { var optionSet, option, options = elem.options, values = jQuery.makeArray( value ), i = options.length; while ( i-- ) { option = options[ i ]; /* eslint-disable no-cond-assign */ if ( option.selected = jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 ) { optionSet = true; } /* eslint-enable no-cond-assign */ } // Force browsers to behave consistently when non-matching value is set if ( !optionSet ) { elem.selectedIndex = -1; } return values; } } } } ); // Radios and checkboxes getter/setter jQuery.each( [ "radio", "checkbox" ], function() { jQuery.valHooks[ this ] = { set: function( elem, value ) { if ( Array.isArray( value ) ) { return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); } } }; if ( !support.checkOn ) { jQuery.valHooks[ this ].get = function( elem ) { return elem.getAttribute( "value" ) === null ? "on" : elem.value; }; } } ); // Return jQuery for attributes-only inclusion support.focusin = "onfocusin" in window; var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, stopPropagationCallback = function( e ) { e.stopPropagation(); }; jQuery.extend( jQuery.event, { trigger: function( event, data, elem, onlyHandlers ) { var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, eventPath = [ elem || document ], type = hasOwn.call( event, "type" ) ? event.type : event, namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; cur = lastElement = tmp = elem = elem || document; // Don't do events on text and comment nodes if ( elem.nodeType === 3 || elem.nodeType === 8 ) { return; } // focus/blur morphs to focusin/out; ensure we're not firing them right now if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { return; } if ( type.indexOf( "." ) > -1 ) { // Namespaced trigger; create a regexp to match event type in handle() namespaces = type.split( "." ); type = namespaces.shift(); namespaces.sort(); } ontype = type.indexOf( ":" ) < 0 && "on" + type; // Caller can pass in a jQuery.Event object, Object, or just an event type string event = event[ jQuery.expando ] ? event : new jQuery.Event( type, typeof event === "object" && event ); // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) event.isTrigger = onlyHandlers ? 2 : 3; event.namespace = namespaces.join( "." ); event.rnamespace = event.namespace ? new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : null; // Clean up the event in case it is being reused event.result = undefined; if ( !event.target ) { event.target = elem; } // Clone any incoming data and prepend the event, creating the handler arg list data = data == null ? [ event ] : jQuery.makeArray( data, [ event ] ); // Allow special events to draw outside the lines special = jQuery.event.special[ type ] || {}; if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { return; } // Determine event propagation path in advance, per W3C events spec (#9951) // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { bubbleType = special.delegateType || type; if ( !rfocusMorph.test( bubbleType + type ) ) { cur = cur.parentNode; } for ( ; cur; cur = cur.parentNode ) { eventPath.push( cur ); tmp = cur; } // Only add window if we got to document (e.g., not plain obj or detached DOM) if ( tmp === ( elem.ownerDocument || document ) ) { eventPath.push( tmp.defaultView || tmp.parentWindow || window ); } } // Fire handlers on the event path i = 0; while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { lastElement = cur; event.type = i > 1 ? bubbleType : special.bindType || type; // jQuery handler handle = ( dataPriv.get( cur, "events" ) || {} )[ event.type ] && dataPriv.get( cur, "handle" ); if ( handle ) { handle.apply( cur, data ); } // Native handler handle = ontype && cur[ ontype ]; if ( handle && handle.apply && acceptData( cur ) ) { event.result = handle.apply( cur, data ); if ( event.result === false ) { event.preventDefault(); } } } event.type = type; // If nobody prevented the default action, do it now if ( !onlyHandlers && !event.isDefaultPrevented() ) { if ( ( !special._default || special._default.apply( eventPath.pop(), data ) === false ) && acceptData( elem ) ) { // Call a native DOM method on the target with the same name as the event. // Don't do default actions on window, that's where global variables be (#6170) if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { // Don't re-trigger an onFOO event when we call its FOO() method tmp = elem[ ontype ]; if ( tmp ) { elem[ ontype ] = null; } // Prevent re-triggering of the same event, since we already bubbled it above jQuery.event.triggered = type; if ( event.isPropagationStopped() ) { lastElement.addEventListener( type, stopPropagationCallback ); } elem[ type ](); if ( event.isPropagationStopped() ) { lastElement.removeEventListener( type, stopPropagationCallback ); } jQuery.event.triggered = undefined; if ( tmp ) { elem[ ontype ] = tmp; } } } } return event.result; }, // Piggyback on a donor event to simulate a different one // Used only for `focus(in | out)` events simulate: function( type, elem, event ) { var e = jQuery.extend( new jQuery.Event(), event, { type: type, isSimulated: true } ); jQuery.event.trigger( e, null, elem ); } } ); jQuery.fn.extend( { trigger: function( type, data ) { return this.each( function() { jQuery.event.trigger( type, data, this ); } ); }, triggerHandler: function( type, data ) { var elem = this[ 0 ]; if ( elem ) { return jQuery.event.trigger( type, data, elem, true ); } } } ); // Support: Firefox <=44 // Firefox doesn't have focus(in | out) events // Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 // // Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 // focus(in | out) events fire after focus & blur events, // which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order // Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 if ( !support.focusin ) { jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { // Attach a single capturing handler on the document while someone wants focusin/focusout var handler = function( event ) { jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); }; jQuery.event.special[ fix ] = { setup: function() { var doc = this.ownerDocument || this, attaches = dataPriv.access( doc, fix ); if ( !attaches ) { doc.addEventListener( orig, handler, true ); } dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); }, teardown: function() { var doc = this.ownerDocument || this, attaches = dataPriv.access( doc, fix ) - 1; if ( !attaches ) { doc.removeEventListener( orig, handler, true ); dataPriv.remove( doc, fix ); } else { dataPriv.access( doc, fix, attaches ); } } }; } ); } var location = window.location; var nonce = Date.now(); var rquery = ( /\?/ ); // Cross-browser xml parsing jQuery.parseXML = function( data ) { var xml; if ( !data || typeof data !== "string" ) { return null; } // Support: IE 9 - 11 only // IE throws on parseFromString with invalid input. try { xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); } catch ( e ) { xml = undefined; } if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { jQuery.error( "Invalid XML: " + data ); } return xml; }; var rbracket = /\[\]$/, rCRLF = /\r?\n/g, rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, rsubmittable = /^(?:input|select|textarea|keygen)/i; function buildParams( prefix, obj, traditional, add ) { var name; if ( Array.isArray( obj ) ) { // Serialize array item. jQuery.each( obj, function( i, v ) { if ( traditional || rbracket.test( prefix ) ) { // Treat each array item as a scalar. add( prefix, v ); } else { // Item is non-scalar (array or object), encode its numeric index. buildParams( prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", v, traditional, add ); } } ); } else if ( !traditional && toType( obj ) === "object" ) { // Serialize object item. for ( name in obj ) { buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); } } else { // Serialize scalar item. add( prefix, obj ); } } // Serialize an array of form elements or a set of // key/values into a query string jQuery.param = function( a, traditional ) { var prefix, s = [], add = function( key, valueOrFunction ) { // If value is a function, invoke it and use its return value var value = isFunction( valueOrFunction ) ? valueOrFunction() : valueOrFunction; s[ s.length ] = encodeURIComponent( key ) + "=" + encodeURIComponent( value == null ? "" : value ); }; if ( a == null ) { return ""; } // If an array was passed in, assume that it is an array of form elements. if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { // Serialize the form elements jQuery.each( a, function() { add( this.name, this.value ); } ); } else { // If traditional, encode the "old" way (the way 1.3.2 or older // did it), otherwise encode params recursively. for ( prefix in a ) { buildParams( prefix, a[ prefix ], traditional, add ); } } // Return the resulting serialization return s.join( "&" ); }; jQuery.fn.extend( { serialize: function() { return jQuery.param( this.serializeArray() ); }, serializeArray: function() { return this.map( function() { // Can add propHook for "elements" to filter or add form elements var elements = jQuery.prop( this, "elements" ); return elements ? jQuery.makeArray( elements ) : this; } ) .filter( function() { var type = this.type; // Use .is( ":disabled" ) so that fieldset[disabled] works return this.name && !jQuery( this ).is( ":disabled" ) && rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && ( this.checked || !rcheckableType.test( type ) ); } ) .map( function( i, elem ) { var val = jQuery( this ).val(); if ( val == null ) { return null; } if ( Array.isArray( val ) ) { return jQuery.map( val, function( val ) { return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; } ); } return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; } ).get(); } } ); var r20 = /%20/g, rhash = /#.*$/, rantiCache = /([?&])_=[^&]*/, rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, // #7653, #8125, #8152: local protocol detection rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, rnoContent = /^(?:GET|HEAD)$/, rprotocol = /^\/\//, /* Prefilters * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) * 2) These are called: * - BEFORE asking for a transport * - AFTER param serialization (s.data is a string if s.processData is true) * 3) key is the dataType * 4) the catchall symbol "*" can be used * 5) execution will start with transport dataType and THEN continue down to "*" if needed */ prefilters = {}, /* Transports bindings * 1) key is the dataType * 2) the catchall symbol "*" can be used * 3) selection will start with transport dataType and THEN go to "*" if needed */ transports = {}, // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression allTypes = "*/".concat( "*" ), // Anchor tag for parsing the document origin originAnchor = document.createElement( "a" ); originAnchor.href = location.href; // Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport function addToPrefiltersOrTransports( structure ) { // dataTypeExpression is optional and defaults to "*" return function( dataTypeExpression, func ) { if ( typeof dataTypeExpression !== "string" ) { func = dataTypeExpression; dataTypeExpression = "*"; } var dataType, i = 0, dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; if ( isFunction( func ) ) { // For each dataType in the dataTypeExpression while ( ( dataType = dataTypes[ i++ ] ) ) { // Prepend if requested if ( dataType[ 0 ] === "+" ) { dataType = dataType.slice( 1 ) || "*"; ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); // Otherwise append } else { ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); } } } }; } // Base inspection function for prefilters and transports function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { var inspected = {}, seekingTransport = ( structure === transports ); function inspect( dataType ) { var selected; inspected[ dataType ] = true; jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); if ( typeof dataTypeOrTransport === "string" && !seekingTransport && !inspected[ dataTypeOrTransport ] ) { options.dataTypes.unshift( dataTypeOrTransport ); inspect( dataTypeOrTransport ); return false; } else if ( seekingTransport ) { return !( selected = dataTypeOrTransport ); } } ); return selected; } return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); } // A special extend for ajax options // that takes "flat" options (not to be deep extended) // Fixes #9887 function ajaxExtend( target, src ) { var key, deep, flatOptions = jQuery.ajaxSettings.flatOptions || {}; for ( key in src ) { if ( src[ key ] !== undefined ) { ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; } } if ( deep ) { jQuery.extend( true, target, deep ); } return target; } /* Handles responses to an ajax request: * - finds the right dataType (mediates between content-type and expected dataType) * - returns the corresponding response */ function ajaxHandleResponses( s, jqXHR, responses ) { var ct, type, finalDataType, firstDataType, contents = s.contents, dataTypes = s.dataTypes; // Remove auto dataType and get content-type in the process while ( dataTypes[ 0 ] === "*" ) { dataTypes.shift(); if ( ct === undefined ) { ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); } } // Check if we're dealing with a known content-type if ( ct ) { for ( type in contents ) { if ( contents[ type ] && contents[ type ].test( ct ) ) { dataTypes.unshift( type ); break; } } } // Check to see if we have a response for the expected dataType if ( dataTypes[ 0 ] in responses ) { finalDataType = dataTypes[ 0 ]; } else { // Try convertible dataTypes for ( type in responses ) { if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { finalDataType = type; break; } if ( !firstDataType ) { firstDataType = type; } } // Or just use first one finalDataType = finalDataType || firstDataType; } // If we found a dataType // We add the dataType to the list if needed // and return the corresponding response if ( finalDataType ) { if ( finalDataType !== dataTypes[ 0 ] ) { dataTypes.unshift( finalDataType ); } return responses[ finalDataType ]; } } /* Chain conversions given the request and the original response * Also sets the responseXXX fields on the jqXHR instance */ function ajaxConvert( s, response, jqXHR, isSuccess ) { var conv2, current, conv, tmp, prev, converters = {}, // Work with a copy of dataTypes in case we need to modify it for conversion dataTypes = s.dataTypes.slice(); // Create converters map with lowercased keys if ( dataTypes[ 1 ] ) { for ( conv in s.converters ) { converters[ conv.toLowerCase() ] = s.converters[ conv ]; } } current = dataTypes.shift(); // Convert to each sequential dataType while ( current ) { if ( s.responseFields[ current ] ) { jqXHR[ s.responseFields[ current ] ] = response; } // Apply the dataFilter if provided if ( !prev && isSuccess && s.dataFilter ) { response = s.dataFilter( response, s.dataType ); } prev = current; current = dataTypes.shift(); if ( current ) { // There's only work to do if current dataType is non-auto if ( current === "*" ) { current = prev; // Convert response if prev dataType is non-auto and differs from current } else if ( prev !== "*" && prev !== current ) { // Seek a direct converter conv = converters[ prev + " " + current ] || converters[ "* " + current ]; // If none found, seek a pair if ( !conv ) { for ( conv2 in converters ) { // If conv2 outputs current tmp = conv2.split( " " ); if ( tmp[ 1 ] === current ) { // If prev can be converted to accepted input conv = converters[ prev + " " + tmp[ 0 ] ] || converters[ "* " + tmp[ 0 ] ]; if ( conv ) { // Condense equivalence converters if ( conv === true ) { conv = converters[ conv2 ]; // Otherwise, insert the intermediate dataType } else if ( converters[ conv2 ] !== true ) { current = tmp[ 0 ]; dataTypes.unshift( tmp[ 1 ] ); } break; } } } } // Apply converter (if not an equivalence) if ( conv !== true ) { // Unless errors are allowed to bubble, catch and return them if ( conv && s.throws ) { response = conv( response ); } else { try { response = conv( response ); } catch ( e ) { return { state: "parsererror", error: conv ? e : "No conversion from " + prev + " to " + current }; } } } } } } return { state: "success", data: response }; } jQuery.extend( { // Counter for holding the number of active queries active: 0, // Last-Modified header cache for next request lastModified: {}, etag: {}, ajaxSettings: { url: location.href, type: "GET", isLocal: rlocalProtocol.test( location.protocol ), global: true, processData: true, async: true, contentType: "application/x-www-form-urlencoded; charset=UTF-8", /* timeout: 0, data: null, dataType: null, username: null, password: null, cache: null, throws: false, traditional: false, headers: {}, */ accepts: { "*": allTypes, text: "text/plain", html: "text/html", xml: "application/xml, text/xml", json: "application/json, text/javascript" }, contents: { xml: /\bxml\b/, html: /\bhtml/, json: /\bjson\b/ }, responseFields: { xml: "responseXML", text: "responseText", json: "responseJSON" }, // Data converters // Keys separate source (or catchall "*") and destination types with a single space converters: { // Convert anything to text "* text": String, // Text to html (true = no transformation) "text html": true, // Evaluate text as a json expression "text json": JSON.parse, // Parse text as xml "text xml": jQuery.parseXML }, // For options that shouldn't be deep extended: // you can add your own custom options here if // and when you create one that shouldn't be // deep extended (see ajaxExtend) flatOptions: { url: true, context: true } }, // Creates a full fledged settings object into target // with both ajaxSettings and settings fields. // If target is omitted, writes into ajaxSettings. ajaxSetup: function( target, settings ) { return settings ? // Building a settings object ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : // Extending ajaxSettings ajaxExtend( jQuery.ajaxSettings, target ); }, ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), ajaxTransport: addToPrefiltersOrTransports( transports ), // Main method ajax: function( url, options ) { // If url is an object, simulate pre-1.5 signature if ( typeof url === "object" ) { options = url; url = undefined; } // Force options to be an object options = options || {}; var transport, // URL without anti-cache param cacheURL, // Response headers responseHeadersString, responseHeaders, // timeout handle timeoutTimer, // Url cleanup var urlAnchor, // Request state (becomes false upon send and true upon completion) completed, // To know if global events are to be dispatched fireGlobals, // Loop variable i, // uncached part of the url uncached, // Create the final options object s = jQuery.ajaxSetup( {}, options ), // Callbacks context callbackContext = s.context || s, // Context for global events is callbackContext if it is a DOM node or jQuery collection globalEventContext = s.context && ( callbackContext.nodeType || callbackContext.jquery ) ? jQuery( callbackContext ) : jQuery.event, // Deferreds deferred = jQuery.Deferred(), completeDeferred = jQuery.Callbacks( "once memory" ), // Status-dependent callbacks statusCode = s.statusCode || {}, // Headers (they are sent all at once) requestHeaders = {}, requestHeadersNames = {}, // Default abort message strAbort = "canceled", // Fake xhr jqXHR = { readyState: 0, // Builds headers hashtable if needed getResponseHeader: function( key ) { var match; if ( completed ) { if ( !responseHeaders ) { responseHeaders = {}; while ( ( match = rheaders.exec( responseHeadersString ) ) ) { responseHeaders[ match[ 1 ].toLowerCase() + " " ] = ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) .concat( match[ 2 ] ); } } match = responseHeaders[ key.toLowerCase() + " " ]; } return match == null ? null : match.join( ", " ); }, // Raw string getAllResponseHeaders: function() { return completed ? responseHeadersString : null; }, // Caches the header setRequestHeader: function( name, value ) { if ( completed == null ) { name = requestHeadersNames[ name.toLowerCase() ] = requestHeadersNames[ name.toLowerCase() ] || name; requestHeaders[ name ] = value; } return this; }, // Overrides response content-type header overrideMimeType: function( type ) { if ( completed == null ) { s.mimeType = type; } return this; }, // Status-dependent callbacks statusCode: function( map ) { var code; if ( map ) { if ( completed ) { // Execute the appropriate callbacks jqXHR.always( map[ jqXHR.status ] ); } else { // Lazy-add the new callbacks in a way that preserves old ones for ( code in map ) { statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; } } } return this; }, // Cancel the request abort: function( statusText ) { var finalText = statusText || strAbort; if ( transport ) { transport.abort( finalText ); } done( 0, finalText ); return this; } }; // Attach deferreds deferred.promise( jqXHR ); // Add protocol if not provided (prefilters might expect it) // Handle falsy url in the settings object (#10093: consistency with old signature) // We also use the url parameter if available s.url = ( ( url || s.url || location.href ) + "" ) .replace( rprotocol, location.protocol + "//" ); // Alias method option to type as per ticket #12004 s.type = options.method || options.type || s.method || s.type; // Extract dataTypes list s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; // A cross-domain request is in order when the origin doesn't match the current origin. if ( s.crossDomain == null ) { urlAnchor = document.createElement( "a" ); // Support: IE <=8 - 11, Edge 12 - 15 // IE throws exception on accessing the href property if url is malformed, // e.g. http://example.com:80x/ try { urlAnchor.href = s.url; // Support: IE <=8 - 11 only // Anchor's host property isn't correctly set when s.url is relative urlAnchor.href = urlAnchor.href; s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== urlAnchor.protocol + "//" + urlAnchor.host; } catch ( e ) { // If there is an error parsing the URL, assume it is crossDomain, // it can be rejected by the transport if it is invalid s.crossDomain = true; } } // Convert data if not already a string if ( s.data && s.processData && typeof s.data !== "string" ) { s.data = jQuery.param( s.data, s.traditional ); } // Apply prefilters inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); // If request was aborted inside a prefilter, stop there if ( completed ) { return jqXHR; } // We can fire global events as of now if asked to // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) fireGlobals = jQuery.event && s.global; // Watch for a new set of requests if ( fireGlobals && jQuery.active++ === 0 ) { jQuery.event.trigger( "ajaxStart" ); } // Uppercase the type s.type = s.type.toUpperCase(); // Determine if request has content s.hasContent = !rnoContent.test( s.type ); // Save the URL in case we're toying with the If-Modified-Since // and/or If-None-Match header later on // Remove hash to simplify url manipulation cacheURL = s.url.replace( rhash, "" ); // More options handling for requests with no content if ( !s.hasContent ) { // Remember the hash so we can put it back uncached = s.url.slice( cacheURL.length ); // If data is available and should be processed, append data to url if ( s.data && ( s.processData || typeof s.data === "string" ) ) { cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; // #9682: remove data so that it's not used in an eventual retry delete s.data; } // Add or update anti-cache param if needed if ( s.cache === false ) { cacheURL = cacheURL.replace( rantiCache, "$1" ); uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce++ ) + uncached; } // Put hash and anti-cache on the URL that will be requested (gh-1732) s.url = cacheURL + uncached; // Change '%20' to '+' if this is encoded form body content (gh-2658) } else if ( s.data && s.processData && ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { s.data = s.data.replace( r20, "+" ); } // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. if ( s.ifModified ) { if ( jQuery.lastModified[ cacheURL ] ) { jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); } if ( jQuery.etag[ cacheURL ] ) { jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); } } // Set the correct header, if data is being sent if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { jqXHR.setRequestHeader( "Content-Type", s.contentType ); } // Set the Accepts header for the server, depending on the dataType jqXHR.setRequestHeader( "Accept", s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? s.accepts[ s.dataTypes[ 0 ] ] + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : s.accepts[ "*" ] ); // Check for headers option for ( i in s.headers ) { jqXHR.setRequestHeader( i, s.headers[ i ] ); } // Allow custom headers/mimetypes and early abort if ( s.beforeSend && ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { // Abort if not done already and return return jqXHR.abort(); } // Aborting is no longer a cancellation strAbort = "abort"; // Install callbacks on deferreds completeDeferred.add( s.complete ); jqXHR.done( s.success ); jqXHR.fail( s.error ); // Get transport transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); // If no transport, we auto-abort if ( !transport ) { done( -1, "No Transport" ); } else { jqXHR.readyState = 1; // Send global event if ( fireGlobals ) { globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); } // If request was aborted inside ajaxSend, stop there if ( completed ) { return jqXHR; } // Timeout if ( s.async && s.timeout > 0 ) { timeoutTimer = window.setTimeout( function() { jqXHR.abort( "timeout" ); }, s.timeout ); } try { completed = false; transport.send( requestHeaders, done ); } catch ( e ) { // Rethrow post-completion exceptions if ( completed ) { throw e; } // Propagate others as results done( -1, e ); } } // Callback for when everything is done function done( status, nativeStatusText, responses, headers ) { var isSuccess, success, error, response, modified, statusText = nativeStatusText; // Ignore repeat invocations if ( completed ) { return; } completed = true; // Clear timeout if it exists if ( timeoutTimer ) { window.clearTimeout( timeoutTimer ); } // Dereference transport for early garbage collection // (no matter how long the jqXHR object will be used) transport = undefined; // Cache response headers responseHeadersString = headers || ""; // Set readyState jqXHR.readyState = status > 0 ? 4 : 0; // Determine if successful isSuccess = status >= 200 && status < 300 || status === 304; // Get response data if ( responses ) { response = ajaxHandleResponses( s, jqXHR, responses ); } // Convert no matter what (that way responseXXX fields are always set) response = ajaxConvert( s, response, jqXHR, isSuccess ); // If successful, handle type chaining if ( isSuccess ) { // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. if ( s.ifModified ) { modified = jqXHR.getResponseHeader( "Last-Modified" ); if ( modified ) { jQuery.lastModified[ cacheURL ] = modified; } modified = jqXHR.getResponseHeader( "etag" ); if ( modified ) { jQuery.etag[ cacheURL ] = modified; } } // if no content if ( status === 204 || s.type === "HEAD" ) { statusText = "nocontent"; // if not modified } else if ( status === 304 ) { statusText = "notmodified"; // If we have data, let's convert it } else { statusText = response.state; success = response.data; error = response.error; isSuccess = !error; } } else { // Extract error from statusText and normalize for non-aborts error = statusText; if ( status || !statusText ) { statusText = "error"; if ( status < 0 ) { status = 0; } } } // Set data for the fake xhr object jqXHR.status = status; jqXHR.statusText = ( nativeStatusText || statusText ) + ""; // Success/Error if ( isSuccess ) { deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); } else { deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); } // Status-dependent callbacks jqXHR.statusCode( statusCode ); statusCode = undefined; if ( fireGlobals ) { globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", [ jqXHR, s, isSuccess ? success : error ] ); } // Complete completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); if ( fireGlobals ) { globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); // Handle the global AJAX counter if ( !( --jQuery.active ) ) { jQuery.event.trigger( "ajaxStop" ); } } } return jqXHR; }, getJSON: function( url, data, callback ) { return jQuery.get( url, data, callback, "json" ); }, getScript: function( url, callback ) { return jQuery.get( url, undefined, callback, "script" ); } } ); jQuery.each( [ "get", "post" ], function( i, method ) { jQuery[ method ] = function( url, data, callback, type ) { // Shift arguments if data argument was omitted if ( isFunction( data ) ) { type = type || callback; callback = data; data = undefined; } // The url can be an options object (which then must have .url) return jQuery.ajax( jQuery.extend( { url: url, type: method, dataType: type, data: data, success: callback }, jQuery.isPlainObject( url ) && url ) ); }; } ); jQuery._evalUrl = function( url, options ) { return jQuery.ajax( { url: url, // Make this explicit, since user can override this through ajaxSetup (#11264) type: "GET", dataType: "script", cache: true, async: false, global: false, // Only evaluate the response if it is successful (gh-4126) // dataFilter is not invoked for failure responses, so using it instead // of the default converter is kludgy but it works. converters: { "text script": function() {} }, dataFilter: function( response ) { jQuery.globalEval( response, options ); } } ); }; jQuery.fn.extend( { wrapAll: function( html ) { var wrap; if ( this[ 0 ] ) { if ( isFunction( html ) ) { html = html.call( this[ 0 ] ); } // The elements to wrap the target around wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); if ( this[ 0 ].parentNode ) { wrap.insertBefore( this[ 0 ] ); } wrap.map( function() { var elem = this; while ( elem.firstElementChild ) { elem = elem.firstElementChild; } return elem; } ).append( this ); } return this; }, wrapInner: function( html ) { if ( isFunction( html ) ) { return this.each( function( i ) { jQuery( this ).wrapInner( html.call( this, i ) ); } ); } return this.each( function() { var self = jQuery( this ), contents = self.contents(); if ( contents.length ) { contents.wrapAll( html ); } else { self.append( html ); } } ); }, wrap: function( html ) { var htmlIsFunction = isFunction( html ); return this.each( function( i ) { jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); } ); }, unwrap: function( selector ) { this.parent( selector ).not( "body" ).each( function() { jQuery( this ).replaceWith( this.childNodes ); } ); return this; } } ); jQuery.expr.pseudos.hidden = function( elem ) { return !jQuery.expr.pseudos.visible( elem ); }; jQuery.expr.pseudos.visible = function( elem ) { return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); }; jQuery.ajaxSettings.xhr = function() { try { return new window.XMLHttpRequest(); } catch ( e ) {} }; var xhrSuccessStatus = { // File protocol always yields status code 0, assume 200 0: 200, // Support: IE <=9 only // #1450: sometimes IE returns 1223 when it should be 204 1223: 204 }, xhrSupported = jQuery.ajaxSettings.xhr(); support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); support.ajax = xhrSupported = !!xhrSupported; jQuery.ajaxTransport( function( options ) { var callback, errorCallback; // Cross domain only allowed if supported through XMLHttpRequest if ( support.cors || xhrSupported && !options.crossDomain ) { return { send: function( headers, complete ) { var i, xhr = options.xhr(); xhr.open( options.type, options.url, options.async, options.username, options.password ); // Apply custom fields if provided if ( options.xhrFields ) { for ( i in options.xhrFields ) { xhr[ i ] = options.xhrFields[ i ]; } } // Override mime type if needed if ( options.mimeType && xhr.overrideMimeType ) { xhr.overrideMimeType( options.mimeType ); } // X-Requested-With header // For cross-domain requests, seeing as conditions for a preflight are // akin to a jigsaw puzzle, we simply never set it to be sure. // (it can always be set on a per-request basis or even using ajaxSetup) // For same-domain requests, won't change header if already provided. if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { headers[ "X-Requested-With" ] = "XMLHttpRequest"; } // Set headers for ( i in headers ) { xhr.setRequestHeader( i, headers[ i ] ); } // Callback callback = function( type ) { return function() { if ( callback ) { callback = errorCallback = xhr.onload = xhr.onerror = xhr.onabort = xhr.ontimeout = xhr.onreadystatechange = null; if ( type === "abort" ) { xhr.abort(); } else if ( type === "error" ) { // Support: IE <=9 only // On a manual native abort, IE9 throws // errors on any property access that is not readyState if ( typeof xhr.status !== "number" ) { complete( 0, "error" ); } else { complete( // File: protocol always yields status 0; see #8605, #14207 xhr.status, xhr.statusText ); } } else { complete( xhrSuccessStatus[ xhr.status ] || xhr.status, xhr.statusText, // Support: IE <=9 only // IE9 has no XHR2 but throws on binary (trac-11426) // For XHR2 non-text, let the caller handle it (gh-2498) ( xhr.responseType || "text" ) !== "text" || typeof xhr.responseText !== "string" ? { binary: xhr.response } : { text: xhr.responseText }, xhr.getAllResponseHeaders() ); } } }; }; // Listen to events xhr.onload = callback(); errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); // Support: IE 9 only // Use onreadystatechange to replace onabort // to handle uncaught aborts if ( xhr.onabort !== undefined ) { xhr.onabort = errorCallback; } else { xhr.onreadystatechange = function() { // Check readyState before timeout as it changes if ( xhr.readyState === 4 ) { // Allow onerror to be called first, // but that will not handle a native abort // Also, save errorCallback to a variable // as xhr.onerror cannot be accessed window.setTimeout( function() { if ( callback ) { errorCallback(); } } ); } }; } // Create the abort callback callback = callback( "abort" ); try { // Do send the request (this may raise an exception) xhr.send( options.hasContent && options.data || null ); } catch ( e ) { // #14683: Only rethrow if this hasn't been notified as an error yet if ( callback ) { throw e; } } }, abort: function() { if ( callback ) { callback(); } } }; } } ); // Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) jQuery.ajaxPrefilter( function( s ) { if ( s.crossDomain ) { s.contents.script = false; } } ); // Install script dataType jQuery.ajaxSetup( { accepts: { script: "text/javascript, application/javascript, " + "application/ecmascript, application/x-ecmascript" }, contents: { script: /\b(?:java|ecma)script\b/ }, converters: { "text script": function( text ) { jQuery.globalEval( text ); return text; } } } ); // Handle cache's special case and crossDomain jQuery.ajaxPrefilter( "script", function( s ) { if ( s.cache === undefined ) { s.cache = false; } if ( s.crossDomain ) { s.type = "GET"; } } ); // Bind script tag hack transport jQuery.ajaxTransport( "script", function( s ) { // This transport only deals with cross domain or forced-by-attrs requests if ( s.crossDomain || s.scriptAttrs ) { var script, callback; return { send: function( _, complete ) { script = jQuery( "

Index

B | C | D | G | I | L | M | N | O | R | S

B

C

D

G

I

L

M

N

O

R

S

././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/index.html0000644000175000017500000006173100000000000017256 0ustar00greggreg00000000000000 MaxMind DB Python Module — maxminddb 1.5.2 documentation

MaxMind DB Python Module

Description

This is a Python module for reading MaxMind DB files. The module includes both a pure Python reader and an optional C extension.

MaxMind DB is a binary file format that stores data indexed by IP address subnets (IPv4 or IPv6).

Installation

If you want to use the C extension, you must first install libmaxminddb C library installed before installing this extension. If the library is not available, the module will fall-back to a pure Python implementation.

To install maxminddb, type:

$ pip install maxminddb

If you are not able to use pip, you may also use easy_install from the source directory:

$ easy_install .

Usage

To use this module, you must first download or create a MaxMind DB file. We provide free GeoLite2 databases. These files must be decompressed with gunzip.

After you have obtained a database and imported the module, call open_database with a path, or file descriptor (in the case of MODE_FD), to the database as the first argument. Optionally, you may pass a mode as the second argument. The modes are exported from maxminddb. Valid modes are:

  • MODE_MMAP_EXT - use the C extension with memory map.

  • MODE_MMAP - read from memory map. Pure Python.

  • MODE_FILE - read database as standard file. Pure Python.

  • MODE_MEMORY - load database into memory. Pure Python.

  • MODE_FD - load database into memory from a file descriptor. Pure Python.

  • MODE_AUTO - try MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that order. Default.

NOTE: When using MODE_FD, it is the caller’s responsibility to be sure that the file descriptor gets closed properly. The caller may close the file descriptor immediately after the Reader object is created.

The open_database function returns a Reader object. To look up an IP address, use the get method on this object. The method will return the corresponding values for the IP address from the database (e.g., a dictionary for GeoIP2/GeoLite2 databases). If the database does not contain a record for that IP address, the method will return None.

If you wish to also retrieve the prefix length for the record, use the get_with_prefix_len method. This returns a tuple containing the record followed by the network prefix length associated with the record.

Example

>>> import maxminddb
>>>
>>> reader = maxminddb.open_database('GeoLite2-City.mmdb')
>>>
>>> reader.get('1.1.1.1')
{'country': ... }
>>>
>>> reader.get_with_prefix_len('1.1.1.1')
({'country': ... }, 24)
>>>
>>> reader.close()

Exceptions

The module will return an InvalidDatabaseError if the database is corrupt or otherwise invalid. A ValueError will be thrown if you look up an invalid IP address or an IPv6 address in an IPv4 database.

Requirements

This code requires Python 2.7+ or 3.5+. Older versions are not supported. The C extension requires CPython. The pure Python implementation has been tested with PyPy.

On Python 2, the ipaddress module is required.

Versioning

The MaxMind DB Python module uses Semantic Versioning.

Support

Please report all issues with this code using the GitHub issue tracker

If you are having an issue with a MaxMind service that is not specific to this API, please contact MaxMind support for assistance.

Modules

maxminddb.Reader(database)

This exists for backwards compatibility. Use open_database instead

maxminddb.open_database(database, mode=0)

Open a Maxmind DB database

Arguments:
database – A path to a valid MaxMind DB file such as a GeoIP2 database

file, or a file descriptor in the case of MODE_FD.

mode – mode to open the database with. Valid mode are:

  • MODE_MMAP_EXT - use the C extension with memory map.

  • MODE_MMAP - read from memory map. Pure Python.

  • MODE_FILE - read database as standard file. Pure Python.

  • MODE_MEMORY - load database into memory. Pure Python.

  • MODE_FD - the param passed via database is a file descriptor, not

    a path. This mode implies MODE_MEMORY.

  • MODE_AUTO - tries MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that

    order. Default mode.

maxminddb.errors

This module contains custom errors for the MaxMind DB reader

exception maxminddb.errors.InvalidDatabaseError

Bases: RuntimeError

This error is thrown when unexpected data is found in the database.

maxminddb.reader

This module contains the pure Python database reader and related classes.

class maxminddb.reader.Metadata(**kwargs)

Bases: object

Metadata for the MaxMind DB reader

binary_format_major_version

The major version number of the binary format used when creating the database.

Type

int

binary_format_minor_version

The minor version number of the binary format used when creating the database.

Type

int

build_epoch

The Unix epoch for the build time of the database.

Type

int

database_type

A string identifying the database type, e.g., “GeoIP2-City”.

Type

str

description

A map from locales to text descriptions of the database.

Type

dict(str, str)

ip_version

The IP version of the data in a database. A value of “4” means the database only supports IPv4. A database with a value of “6” may support both IPv4 and IPv6 lookups.

Type

int

languages

A list of locale codes supported by the databse.

Type

list(str)

node_count

The number of nodes in the database.

Type

int

record_size

The bit size of a record in the search tree.

Type

int

property node_byte_size

The size of a node in bytes

Type

int

property search_tree_size

The size of the search tree

Type

int

class maxminddb.reader.Reader(database, mode=0)

Bases: object

Instances of this class provide a reader for the MaxMind DB format. IP addresses can be looked up using the get method.

close()

Closes the MaxMind DB file and returns the resources to the system

get(ip_address)

Return the record for the ip_address in the MaxMind DB

Arguments: ip_address – an IP address in the standard string notation

get_with_prefix_len(ip_address)

Return a tuple with the record and the associated prefix length

Arguments: ip_address – an IP address in the standard string notation

metadata()

Return the metadata associated with the MaxMind DB file

Indices and tables

copyright

  1. 2013-2019 by MaxMind, Inc.

license

Apache License, Version 2.0

././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/objects.inv0000644000175000017500000000075300000000000017425 0ustar00greggreg00000000000000# Sphinx inventory version 2 # Project: maxminddb # Version: 1.5.2 # The remainder of this file is compressed using zlib. xڭn E vkfY,,E1Ll*^!JB{a $2V/۠SϤXY[#ptѲ4 h<7]9]RnkPǷXkƢ`Wwͽ&KYaLc@w)TqtnGD|)0;!9EkX͘b>=s"} a> AMІ#ԋ<t:dǏ=d1.N2nX)*_v49/x;&a Jw|H$HX?E././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/py-modindex.html0000644000175000017500000000744600000000000020407 0ustar00greggreg00000000000000 Python Module Index — maxminddb 1.5.2 documentation

Python Module Index

m
 
m
maxminddb
    maxminddb.errors
    maxminddb.reader
././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/search.html0000644000175000017500000000655200000000000017414 0ustar00greggreg00000000000000 Search — maxminddb 1.5.2 documentation

Search

Please activate JavaScript to enable the search functionality.

From here you can search these documents. Enter your search words into the box below and click "search". Note that the search function will automatically search for all of the words. Pages containing fewer words won't appear in the result list.

././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/docs/html/searchindex.js0000644000175000017500000000657000000000000020114 0ustar00greggreg00000000000000Search.setIndex({docnames:["index"],envversion:{"sphinx.domains.c":1,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":1,"sphinx.domains.javascript":1,"sphinx.domains.math":2,"sphinx.domains.python":1,"sphinx.domains.rst":1,"sphinx.domains.std":1,"sphinx.ext.intersphinx":1,sphinx:56},filenames:["index.rst"],objects:{"":{maxminddb:[0,0,0,"-"]},"maxminddb.errors":{InvalidDatabaseError:[0,2,1,""]},"maxminddb.reader":{Metadata:[0,3,1,""],Reader:[0,3,1,""]},"maxminddb.reader.Metadata":{binary_format_major_version:[0,4,1,""],binary_format_minor_version:[0,4,1,""],build_epoch:[0,4,1,""],database_type:[0,4,1,""],description:[0,4,1,""],ip_version:[0,4,1,""],languages:[0,4,1,""],node_byte_size:[0,5,1,""],node_count:[0,4,1,""],record_size:[0,4,1,""],search_tree_size:[0,5,1,""]},"maxminddb.reader.Reader":{close:[0,5,1,""],get:[0,5,1,""],get_with_prefix_len:[0,5,1,""],metadata:[0,5,1,""]},maxminddb:{Reader:[0,1,1,""],errors:[0,0,0,"-"],open_database:[0,1,1,""],reader:[0,0,0,"-"]}},objnames:{"0":["py","module","Python module"],"1":["py","function","Python function"],"2":["py","exception","Python exception"],"3":["py","class","Python class"],"4":["py","attribute","Python attribute"],"5":["py","method","Python method"]},objtypes:{"0":"py:module","1":"py:function","2":"py:exception","3":"py:class","4":"py:attribute","5":"py:method"},terms:{"byte":0,"case":0,"class":0,"default":0,"export":0,"function":0,"import":0,"int":0,"return":0,"try":0,The:0,These:0,Use:0,abl:0,address:0,after:0,all:0,also:0,apach:0,api:0,argument:0,assist:0,associ:0,avail:0,back:0,backward:0,base:0,been:0,befor:0,binari:0,binary_format_major_vers:0,binary_format_minor_vers:0,bit:0,both:0,build:0,build_epoch:0,call:0,caller:0,can:0,citi:0,close:0,code:0,compat:0,contact:0,contain:0,copyright:0,correspond:0,corrupt:0,countri:0,cpython:0,creat:0,custom:0,data:0,databas:0,database_typ:0,databs:0,decompress:0,descriptor:0,dict:0,dictionari:0,directori:0,doe:0,download:0,easy_instal:0,epoch:0,exist:0,extens:0,fall:0,file:0,first:0,follow:0,format:0,found:0,free:0,from:0,geoip2:0,geolite2:0,get:0,get_with_prefix_len:0,github:0,gunzip:0,has:0,have:0,identifi:0,immedi:0,implement:0,impli:0,inc:0,includ:0,index:0,instanc:0,instead:0,invalid:0,invaliddatabaseerror:0,ip_address:0,ip_vers:0,ipaddress:0,ipv4:0,ipv6:0,issu:0,kwarg:0,languag:0,length:0,libmaxminddb:0,librari:0,licens:0,list:0,load:0,local:0,look:0,lookup:0,mai:0,major:0,map:0,mean:0,memori:0,metadata:0,method:0,minor:0,mmdb:0,mode:0,mode_auto:0,mode_fd:0,mode_fil:0,mode_memori:0,mode_mmap:0,mode_mmap_ext:0,must:0,network:0,node:0,node_byte_s:0,node_count:0,none:0,notat:0,note:0,number:0,object:0,obtain:0,older:0,onli:0,open:0,open_databas:0,option:0,order:0,otherwis:0,page:0,param:0,pass:0,path:0,pip:0,pleas:0,prefix:0,properli:0,properti:0,provid:0,pure:0,pypi:0,read:0,record:0,record_s:0,relat:0,report:0,resourc:0,respons:0,retriev:0,runtimeerror:0,search:0,search_tree_s:0,second:0,semant:0,servic:0,size:0,sourc:0,specif:0,standard:0,store:0,str:0,string:0,subnet:0,sure:0,system:0,test:0,text:0,thi:0,thrown:0,time:0,tracker:0,tree:0,tri:0,tupl:0,type:0,unexpect:0,unix:0,use:0,used:0,uses:0,using:0,valid:0,valu:0,valueerror:0,via:0,want:0,when:0,wish:0,you:0},titles:["MaxMind DB Python Module"],titleterms:{descript:0,error:0,exampl:0,except:0,indic:0,instal:0,maxmind:0,maxminddb:0,modul:0,python:0,reader:0,requir:0,support:0,tabl:0,usag:0,version:0}})././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3852544 maxminddb-1.5.2/extension/0000755000175000017500000000000000000000000015371 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1569618803.0 maxminddb-1.5.2/extension/maxminddb.c0000644000175000017500000005571400000000000017514 0ustar00greggreg00000000000000#include #include #include #include #include #include #define __STDC_FORMAT_MACROS #include static PyTypeObject Reader_Type; static PyTypeObject Metadata_Type; static PyObject *MaxMindDB_error; // clang-format off typedef struct { PyObject_HEAD /* no semicolon */ MMDB_s *mmdb; PyObject *closed; } Reader_obj; typedef struct { PyObject_HEAD /* no semicolon */ PyObject *binary_format_major_version; PyObject *binary_format_minor_version; PyObject *build_epoch; PyObject *database_type; PyObject *description; PyObject *ip_version; PyObject *languages; PyObject *node_count; PyObject *record_size; } Metadata_obj; // clang-format on static int get_record(PyObject *self, PyObject *args, PyObject **record); static bool format_sockaddr(struct sockaddr *addr, char *dst); static PyObject *from_entry_data_list(MMDB_entry_data_list_s **entry_data_list); static PyObject *from_map(MMDB_entry_data_list_s **entry_data_list); static PyObject *from_array(MMDB_entry_data_list_s **entry_data_list); static PyObject *from_uint128(const MMDB_entry_data_list_s *entry_data_list); static int ip_converter(PyObject *obj, struct sockaddr_storage *ip_address); #if PY_MAJOR_VERSION >= 3 #define MOD_INIT(name) PyMODINIT_FUNC PyInit_##name(void) #define RETURN_MOD_INIT(m) return (m) #define FILE_NOT_FOUND_ERROR PyExc_FileNotFoundError #else #define MOD_INIT(name) PyMODINIT_FUNC init##name(void) #define RETURN_MOD_INIT(m) return #define PyInt_FromLong PyLong_FromLong #define FILE_NOT_FOUND_ERROR PyExc_IOError #endif #ifdef __GNUC__ #define UNUSED(x) UNUSED_##x __attribute__((__unused__)) #else #define UNUSED(x) UNUSED_##x #endif static int Reader_init(PyObject *self, PyObject *args, PyObject *kwds) { char *filename; int mode = 0; static char *kwlist[] = {"database", "mode", NULL}; if (!PyArg_ParseTupleAndKeywords( args, kwds, "s|i", kwlist, &filename, &mode)) { return -1; } if (mode != 0 && mode != 1) { PyErr_Format( PyExc_ValueError, "Unsupported open mode (%i). Only " "MODE_AUTO and MODE_MMAP_EXT are supported by this extension.", mode); return -1; } if (0 != access(filename, R_OK)) { PyErr_Format( FILE_NOT_FOUND_ERROR, "No such file or directory: '%s'", filename); return -1; } MMDB_s *mmdb = (MMDB_s *)malloc(sizeof(MMDB_s)); if (NULL == mmdb) { PyErr_NoMemory(); return -1; } Reader_obj *mmdb_obj = (Reader_obj *)self; if (!mmdb_obj) { free(mmdb); PyErr_NoMemory(); return -1; } uint16_t status = MMDB_open(filename, MMDB_MODE_MMAP, mmdb); if (MMDB_SUCCESS != status) { free(mmdb); PyErr_Format(MaxMindDB_error, "Error opening database file (%s). Is this a valid " "MaxMind DB file?", filename); return -1; } mmdb_obj->mmdb = mmdb; mmdb_obj->closed = Py_False; return 0; } static PyObject *Reader_get(PyObject *self, PyObject *args) { PyObject *record = NULL; if (get_record(self, args, &record) == -1) { return NULL; } return record; } static PyObject *Reader_get_with_prefix_len(PyObject *self, PyObject *args) { PyObject *record = NULL; int prefix_len = get_record(self, args, &record); if (prefix_len == -1) { return NULL; } PyObject *tuple = Py_BuildValue("(Oi)", record, prefix_len); Py_DECREF(record); return tuple; } static int get_record(PyObject *self, PyObject *args, PyObject **record) { MMDB_s *mmdb = ((Reader_obj *)self)->mmdb; if (NULL == mmdb) { PyErr_SetString(PyExc_ValueError, "Attempt to read from a closed MaxMind DB."); return -1; } struct sockaddr_storage ip_address_ss = {0}; struct sockaddr *ip_address = (struct sockaddr *)&ip_address_ss; if (!PyArg_ParseTuple(args, "O&", ip_converter, &ip_address_ss)) { return -1; } if (!ip_address->sa_family) { PyErr_SetString(PyExc_ValueError, "Error parsing argument"); return -1; } int mmdb_error = MMDB_SUCCESS; MMDB_lookup_result_s result = MMDB_lookup_sockaddr(mmdb, ip_address, &mmdb_error); if (MMDB_SUCCESS != mmdb_error) { PyObject *exception; if (MMDB_IPV6_LOOKUP_IN_IPV4_DATABASE_ERROR == mmdb_error) { exception = PyExc_ValueError; } else { exception = MaxMindDB_error; } char ipstr[INET6_ADDRSTRLEN] = {0}; if (format_sockaddr(ip_address, ipstr)) { PyErr_Format(exception, "Error looking up %s. %s", ipstr, MMDB_strerror(mmdb_error)); } return -1; } int prefix_len = result.netmask; if (ip_address->sa_family == AF_INET && mmdb->metadata.ip_version == 6) { // We return the prefix length given the IPv4 address. If there is // no IPv4 subtree, we return a prefix length of 0. prefix_len = prefix_len >= 96 ? prefix_len - 96 : 0; } if (!result.found_entry) { Py_INCREF(Py_None); *record = Py_None; return prefix_len; } MMDB_entry_data_list_s *entry_data_list = NULL; int status = MMDB_get_entry_data_list(&result.entry, &entry_data_list); if (MMDB_SUCCESS != status) { char ipstr[INET6_ADDRSTRLEN] = {0}; if (format_sockaddr(ip_address, ipstr)) { PyErr_Format(MaxMindDB_error, "Error while looking up data for %s. %s", ipstr, MMDB_strerror(status)); } MMDB_free_entry_data_list(entry_data_list); return -1; } MMDB_entry_data_list_s *original_entry_data_list = entry_data_list; *record = from_entry_data_list(&entry_data_list); MMDB_free_entry_data_list(original_entry_data_list); return prefix_len; } static int ip_converter(PyObject *obj, struct sockaddr_storage *ip_address) { #if PY_MAJOR_VERSION >= 3 if (PyUnicode_Check(obj)) { Py_ssize_t len; const char *ipstr = PyUnicode_AsUTF8AndSize(obj, &len); #else if (PyUnicode_Check(obj) || PyString_Check(obj)) { // Although this should work on Python 3, we will hopefully delete // this soon and the Python 3 version is cleaner. const char *ipstr = PyString_AsString(obj); Py_ssize_t len = PyString_Size(obj); #endif if (!ipstr) { PyErr_SetString(PyExc_TypeError, "argument 1 contains an invalid string"); return 0; } if (strlen(ipstr) != (size_t)len) { PyErr_SetString(PyExc_TypeError, "argument 1 contains an embedded null character"); return 0; } struct addrinfo hints = { .ai_family = AF_UNSPEC, .ai_flags = AI_NUMERICHOST, // We set ai_socktype so that we only get one result back .ai_socktype = SOCK_STREAM}; struct addrinfo *addresses = NULL; int gai_status = getaddrinfo(ipstr, NULL, &hints, &addresses); if (gai_status) { PyErr_Format(PyExc_ValueError, "'%s' does not appear to be an IPv4 or IPv6 address.", ipstr); return 0; } if (!addresses) { PyErr_SetString( PyExc_RuntimeError, "getaddrinfo was successful but failed to set the addrinfo"); return 0; } memcpy(ip_address, addresses->ai_addr, addresses->ai_addrlen); freeaddrinfo(addresses); return 1; } PyObject *packed = PyObject_GetAttrString(obj, "packed"); if (!packed) { PyErr_SetString(PyExc_TypeError, "argument 1 must be a string or ipaddress object"); return 0; } Py_ssize_t len; char *bytes; int status = PyBytes_AsStringAndSize(packed, &bytes, &len); if (status == -1) { PyErr_SetString(PyExc_TypeError, "argument 1 must be a string or ipaddress object"); Py_DECREF(packed); return 0; } switch (len) { case 16: { ip_address->ss_family = AF_INET6; struct sockaddr_in6 *sin = (struct sockaddr_in6 *)ip_address; memcpy(sin->sin6_addr.s6_addr, bytes, len); Py_DECREF(packed); return 1; } case 4: { ip_address->ss_family = AF_INET; struct sockaddr_in *sin = (struct sockaddr_in *)ip_address; memcpy(&(sin->sin_addr.s_addr), bytes, len); Py_DECREF(packed); return 1; } default: PyErr_SetString( PyExc_ValueError, "argument 1 returned an unexpected packed length for address"); Py_DECREF(packed); return 0; } } static bool format_sockaddr(struct sockaddr *sa, char *dst) { char *addr; if (sa->sa_family == AF_INET) { struct sockaddr_in *sin = (struct sockaddr_in *)sa; addr = (char *)&sin->sin_addr; } else { struct sockaddr_in6 *sin = (struct sockaddr_in6 *)sa; addr = (char *)&sin->sin6_addr; } if (inet_ntop(sa->sa_family, addr, dst, INET6_ADDRSTRLEN)) { return true; } PyErr_SetString(PyExc_RuntimeError, "unable to format IP address"); return false; } static PyObject *Reader_metadata(PyObject *self, PyObject *UNUSED(args)) { Reader_obj *mmdb_obj = (Reader_obj *)self; if (NULL == mmdb_obj->mmdb) { PyErr_SetString(PyExc_IOError, "Attempt to read from a closed MaxMind DB."); return NULL; } MMDB_entry_data_list_s *entry_data_list; MMDB_get_metadata_as_entry_data_list(mmdb_obj->mmdb, &entry_data_list); MMDB_entry_data_list_s *original_entry_data_list = entry_data_list; PyObject *metadata_dict = from_entry_data_list(&entry_data_list); MMDB_free_entry_data_list(original_entry_data_list); if (NULL == metadata_dict || !PyDict_Check(metadata_dict)) { PyErr_SetString(MaxMindDB_error, "Error decoding metadata."); return NULL; } PyObject *args = PyTuple_New(0); if (NULL == args) { Py_DECREF(metadata_dict); return NULL; } PyObject *metadata = PyObject_Call((PyObject *)&Metadata_Type, args, metadata_dict); Py_DECREF(metadata_dict); return metadata; } static PyObject *Reader_close(PyObject *self, PyObject *UNUSED(args)) { Reader_obj *mmdb_obj = (Reader_obj *)self; if (NULL != mmdb_obj->mmdb) { MMDB_close(mmdb_obj->mmdb); free(mmdb_obj->mmdb); mmdb_obj->mmdb = NULL; } mmdb_obj->closed = Py_True; Py_RETURN_NONE; } static PyObject *Reader__enter__(PyObject *self, PyObject *UNUSED(args)) { Reader_obj *mmdb_obj = (Reader_obj *)self; if (mmdb_obj->closed == Py_True) { PyErr_SetString(PyExc_ValueError, "Attempt to reopen a closed MaxMind DB."); return NULL; } Py_INCREF(self); return (PyObject *)self; } static PyObject *Reader__exit__(PyObject *self, PyObject *UNUSED(args)) { Reader_close(self, NULL); Py_RETURN_NONE; } static void Reader_dealloc(PyObject *self) { Reader_obj *obj = (Reader_obj *)self; if (NULL != obj->mmdb) { Reader_close(self, NULL); } PyObject_Del(self); } static int Metadata_init(PyObject *self, PyObject *args, PyObject *kwds) { PyObject *binary_format_major_version, *binary_format_minor_version, *build_epoch, *database_type, *description, *ip_version, *languages, *node_count, *record_size; static char *kwlist[] = {"binary_format_major_version", "binary_format_minor_version", "build_epoch", "database_type", "description", "ip_version", "languages", "node_count", "record_size", NULL}; if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOOOOOOO", kwlist, &binary_format_major_version, &binary_format_minor_version, &build_epoch, &database_type, &description, &ip_version, &languages, &node_count, &record_size)) { return -1; } Metadata_obj *obj = (Metadata_obj *)self; obj->binary_format_major_version = binary_format_major_version; obj->binary_format_minor_version = binary_format_minor_version; obj->build_epoch = build_epoch; obj->database_type = database_type; obj->description = description; obj->ip_version = ip_version; obj->languages = languages; obj->node_count = node_count; obj->record_size = record_size; Py_INCREF(obj->binary_format_major_version); Py_INCREF(obj->binary_format_minor_version); Py_INCREF(obj->build_epoch); Py_INCREF(obj->database_type); Py_INCREF(obj->description); Py_INCREF(obj->ip_version); Py_INCREF(obj->languages); Py_INCREF(obj->node_count); Py_INCREF(obj->record_size); return 0; } static void Metadata_dealloc(PyObject *self) { Metadata_obj *obj = (Metadata_obj *)self; Py_DECREF(obj->binary_format_major_version); Py_DECREF(obj->binary_format_minor_version); Py_DECREF(obj->build_epoch); Py_DECREF(obj->database_type); Py_DECREF(obj->description); Py_DECREF(obj->ip_version); Py_DECREF(obj->languages); Py_DECREF(obj->node_count); Py_DECREF(obj->record_size); PyObject_Del(self); } static PyObject * from_entry_data_list(MMDB_entry_data_list_s **entry_data_list) { if (NULL == entry_data_list || NULL == *entry_data_list) { PyErr_SetString(MaxMindDB_error, "Error while looking up data. Your database may be " "corrupt or you have found a bug in libmaxminddb."); return NULL; } switch ((*entry_data_list)->entry_data.type) { case MMDB_DATA_TYPE_MAP: return from_map(entry_data_list); case MMDB_DATA_TYPE_ARRAY: return from_array(entry_data_list); case MMDB_DATA_TYPE_UTF8_STRING: return PyUnicode_FromStringAndSize( (*entry_data_list)->entry_data.utf8_string, (*entry_data_list)->entry_data.data_size); case MMDB_DATA_TYPE_BYTES: return PyByteArray_FromStringAndSize( (const char *)(*entry_data_list)->entry_data.bytes, (Py_ssize_t)(*entry_data_list)->entry_data.data_size); case MMDB_DATA_TYPE_DOUBLE: return PyFloat_FromDouble( (*entry_data_list)->entry_data.double_value); case MMDB_DATA_TYPE_FLOAT: return PyFloat_FromDouble( (*entry_data_list)->entry_data.float_value); case MMDB_DATA_TYPE_UINT16: return PyLong_FromLong((*entry_data_list)->entry_data.uint16); case MMDB_DATA_TYPE_UINT32: return PyLong_FromLong((*entry_data_list)->entry_data.uint32); case MMDB_DATA_TYPE_BOOLEAN: return PyBool_FromLong((*entry_data_list)->entry_data.boolean); case MMDB_DATA_TYPE_UINT64: return PyLong_FromUnsignedLongLong( (*entry_data_list)->entry_data.uint64); case MMDB_DATA_TYPE_UINT128: return from_uint128(*entry_data_list); case MMDB_DATA_TYPE_INT32: return PyLong_FromLong((*entry_data_list)->entry_data.int32); default: PyErr_Format(MaxMindDB_error, "Invalid data type arguments: %d", (*entry_data_list)->entry_data.type); return NULL; } return NULL; } static PyObject *from_map(MMDB_entry_data_list_s **entry_data_list) { PyObject *py_obj = PyDict_New(); if (NULL == py_obj) { PyErr_NoMemory(); return NULL; } const uint32_t map_size = (*entry_data_list)->entry_data.data_size; uint i; // entry_data_list cannot start out NULL (see from_entry_data_list). We // check it in the loop because it may become NULL. // coverity[check_after_deref] for (i = 0; i < map_size && entry_data_list; i++) { *entry_data_list = (*entry_data_list)->next; PyObject *key = PyUnicode_FromStringAndSize( (char *)(*entry_data_list)->entry_data.utf8_string, (*entry_data_list)->entry_data.data_size); *entry_data_list = (*entry_data_list)->next; PyObject *value = from_entry_data_list(entry_data_list); if (NULL == value) { Py_DECREF(key); Py_DECREF(py_obj); return NULL; } PyDict_SetItem(py_obj, key, value); Py_DECREF(value); Py_DECREF(key); } return py_obj; } static PyObject *from_array(MMDB_entry_data_list_s **entry_data_list) { const uint32_t size = (*entry_data_list)->entry_data.data_size; PyObject *py_obj = PyList_New(size); if (NULL == py_obj) { PyErr_NoMemory(); return NULL; } uint i; // entry_data_list cannot start out NULL (see from_entry_data_list). We // check it in the loop because it may become NULL. // coverity[check_after_deref] for (i = 0; i < size && entry_data_list; i++) { *entry_data_list = (*entry_data_list)->next; PyObject *value = from_entry_data_list(entry_data_list); if (NULL == value) { Py_DECREF(py_obj); return NULL; } // PyList_SetItem 'steals' the reference PyList_SetItem(py_obj, i, value); } return py_obj; } static PyObject *from_uint128(const MMDB_entry_data_list_s *entry_data_list) { uint64_t high = 0; uint64_t low = 0; #if MMDB_UINT128_IS_BYTE_ARRAY int i; for (i = 0; i < 8; i++) { high = (high << 8) | entry_data_list->entry_data.uint128[i]; } for (i = 8; i < 16; i++) { low = (low << 8) | entry_data_list->entry_data.uint128[i]; } #else high = entry_data_list->entry_data.uint128 >> 64; low = (uint64_t)entry_data_list->entry_data.uint128; #endif char *num_str = malloc(33); if (NULL == num_str) { PyErr_NoMemory(); return NULL; } snprintf(num_str, 33, "%016" PRIX64 "%016" PRIX64, high, low); PyObject *py_obj = PyLong_FromString(num_str, NULL, 16); free(num_str); return py_obj; } static PyMethodDef Reader_methods[] = { {"get", Reader_get, METH_VARARGS, "Return the record for the ip_address in the MaxMind DB"}, {"get_with_prefix_len", Reader_get_with_prefix_len, METH_VARARGS, "Return a tuple with the record and the associated prefix length"}, {"metadata", Reader_metadata, METH_NOARGS, "Return metadata object for database"}, {"close", Reader_close, METH_NOARGS, "Closes database"}, {"__exit__", Reader__exit__, METH_VARARGS, "Called when exiting a with-context. Calls close"}, {"__enter__", Reader__enter__, METH_NOARGS, "Called when entering a with-context."}, {NULL, NULL, 0, NULL}}; static PyMemberDef Reader_members[] = { {"closed", T_OBJECT, offsetof(Reader_obj, closed), READONLY, NULL}, {NULL, 0, 0, 0, NULL}}; // clang-format off static PyTypeObject Reader_Type = { PyVarObject_HEAD_INIT(NULL, 0) .tp_basicsize = sizeof(Reader_obj), .tp_dealloc = Reader_dealloc, .tp_doc = "Reader object", .tp_flags = Py_TPFLAGS_DEFAULT, .tp_methods = Reader_methods, .tp_members = Reader_members, .tp_name = "Reader", .tp_init = Reader_init, }; // clang-format on static PyMethodDef Metadata_methods[] = {{NULL, NULL, 0, NULL}}; static PyMemberDef Metadata_members[] = { {"binary_format_major_version", T_OBJECT, offsetof(Metadata_obj, binary_format_major_version), READONLY, NULL}, {"binary_format_minor_version", T_OBJECT, offsetof(Metadata_obj, binary_format_minor_version), READONLY, NULL}, {"build_epoch", T_OBJECT, offsetof(Metadata_obj, build_epoch), READONLY, NULL}, {"database_type", T_OBJECT, offsetof(Metadata_obj, database_type), READONLY, NULL}, {"description", T_OBJECT, offsetof(Metadata_obj, description), READONLY, NULL}, {"ip_version", T_OBJECT, offsetof(Metadata_obj, ip_version), READONLY, NULL}, {"languages", T_OBJECT, offsetof(Metadata_obj, languages), READONLY, NULL}, {"node_count", T_OBJECT, offsetof(Metadata_obj, node_count), READONLY, NULL}, {"record_size", T_OBJECT, offsetof(Metadata_obj, record_size), READONLY, NULL}, {NULL, 0, 0, 0, NULL}}; // clang-format off static PyTypeObject Metadata_Type = { PyVarObject_HEAD_INIT(NULL, 0) .tp_basicsize = sizeof(Metadata_obj), .tp_dealloc = Metadata_dealloc, .tp_doc = "Metadata object", .tp_flags = Py_TPFLAGS_DEFAULT, .tp_members = Metadata_members, .tp_methods = Metadata_methods, .tp_name = "Metadata", .tp_init = Metadata_init}; // clang-format on static PyMethodDef MaxMindDB_methods[] = {{NULL, NULL, 0, NULL}}; #if PY_MAJOR_VERSION >= 3 static struct PyModuleDef MaxMindDB_module = { PyModuleDef_HEAD_INIT, .m_name = "extension", .m_doc = "This is a C extension to read MaxMind DB file format", .m_methods = MaxMindDB_methods, }; #endif MOD_INIT(extension) { PyObject *m; #if PY_MAJOR_VERSION >= 3 m = PyModule_Create(&MaxMindDB_module); #else m = Py_InitModule("extension", MaxMindDB_methods); #endif if (!m) { RETURN_MOD_INIT(NULL); } Reader_Type.tp_new = PyType_GenericNew; if (PyType_Ready(&Reader_Type)) { RETURN_MOD_INIT(NULL); } Py_INCREF(&Reader_Type); PyModule_AddObject(m, "Reader", (PyObject *)&Reader_Type); Metadata_Type.tp_new = PyType_GenericNew; if (PyType_Ready(&Metadata_Type)) { RETURN_MOD_INIT(NULL); } PyModule_AddObject(m, "extension", (PyObject *)&Metadata_Type); PyObject *error_mod = PyImport_ImportModule("maxminddb.errors"); if (error_mod == NULL) { RETURN_MOD_INIT(NULL); } MaxMindDB_error = PyObject_GetAttrString(error_mod, "InvalidDatabaseError"); Py_DECREF(error_mod); if (MaxMindDB_error == NULL) { RETURN_MOD_INIT(NULL); } Py_INCREF(MaxMindDB_error); /* We primarily add it to the module for backwards compatibility */ PyModule_AddObject(m, "InvalidDatabaseError", MaxMindDB_error); RETURN_MOD_INIT(m); } ././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3852544 maxminddb-1.5.2/maxminddb/0000755000175000017500000000000000000000000015320 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867395.0 maxminddb-1.5.2/maxminddb/__init__.py0000644000175000017500000000412600000000000017434 0ustar00greggreg00000000000000# pylint:disable=C0111 import os import maxminddb.reader try: import maxminddb.extension except ImportError: maxminddb.extension = None from maxminddb.const import (MODE_AUTO, MODE_MMAP, MODE_MMAP_EXT, MODE_FILE, MODE_MEMORY, MODE_FD) from maxminddb.decoder import InvalidDatabaseError def open_database(database, mode=MODE_AUTO): """Open a Maxmind DB database Arguments: database -- A path to a valid MaxMind DB file such as a GeoIP2 database file, or a file descriptor in the case of MODE_FD. mode -- mode to open the database with. Valid mode are: * MODE_MMAP_EXT - use the C extension with memory map. * MODE_MMAP - read from memory map. Pure Python. * MODE_FILE - read database as standard file. Pure Python. * MODE_MEMORY - load database into memory. Pure Python. * MODE_FD - the param passed via database is a file descriptor, not a path. This mode implies MODE_MEMORY. * MODE_AUTO - tries MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that order. Default mode. """ has_extension = maxminddb.extension and hasattr(maxminddb.extension, 'Reader') if (mode == MODE_AUTO and has_extension) or mode == MODE_MMAP_EXT: if not has_extension: raise ValueError( "MODE_MMAP_EXT requires the maxminddb.extension module to be available" ) return maxminddb.extension.Reader(database) if mode in (MODE_AUTO, MODE_MMAP, MODE_FILE, MODE_MEMORY, MODE_FD): return maxminddb.reader.Reader(database, mode) raise ValueError('Unsupported open mode: {0}'.format(mode)) def Reader(database): # pylint: disable=invalid-name """This exists for backwards compatibility. Use open_database instead""" return open_database(database) __title__ = 'maxminddb' __version__ = '1.5.2' __author__ = 'Gregory Oschwald' __license__ = 'Apache License, Version 2.0' __copyright__ = 'Copyright 2013-2019 Maxmind, Inc.' ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576098512.0 maxminddb-1.5.2/maxminddb/compat.py0000644000175000017500000000134700000000000017162 0ustar00greggreg00000000000000import sys import ipaddress # pylint: skip-file if sys.version_info[0] == 2: def compat_ip_address(address): if isinstance(address, bytes): address = address.decode() return ipaddress.ip_address(address) int_from_byte = ord FileNotFoundError = IOError def int_from_bytes(b): if b: return int(b.encode("hex"), 16) return 0 byte_from_int = chr string_type = basestring else: def compat_ip_address(address): return ipaddress.ip_address(address) int_from_byte = lambda x: x FileNotFoundError = FileNotFoundError int_from_bytes = lambda x: int.from_bytes(x, 'big') byte_from_int = lambda x: bytes([x]) string_type = str ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1547072470.0 maxminddb-1.5.2/maxminddb/const.py0000644000175000017500000000017200000000000017020 0ustar00greggreg00000000000000"""Constants used in the API""" MODE_AUTO = 0 MODE_MMAP_EXT = 1 MODE_MMAP = 2 MODE_FILE = 4 MODE_MEMORY = 8 MODE_FD = 16 ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867133.0 maxminddb-1.5.2/maxminddb/decoder.py0000644000175000017500000001446100000000000017305 0ustar00greggreg00000000000000""" maxminddb.decoder ~~~~~~~~~~~~~~~~~ This package contains code for decoding the MaxMind DB data section. """ from __future__ import unicode_literals import struct from maxminddb.compat import byte_from_int, int_from_byte, int_from_bytes from maxminddb.errors import InvalidDatabaseError class Decoder(object): # pylint: disable=too-few-public-methods """Decoder for the data section of the MaxMind DB""" def __init__(self, database_buffer, pointer_base=0, pointer_test=False): """Created a Decoder for a MaxMind DB Arguments: database_buffer -- an mmap'd MaxMind DB file. pointer_base -- the base number to use when decoding a pointer pointer_test -- used for internal unit testing of pointer code """ self._pointer_test = pointer_test self._buffer = database_buffer self._pointer_base = pointer_base def _decode_array(self, size, offset): array = [] for _ in range(size): (value, offset) = self.decode(offset) array.append(value) return array, offset def _decode_boolean(self, size, offset): return size != 0, offset def _decode_bytes(self, size, offset): new_offset = offset + size return self._buffer[offset:new_offset], new_offset def _decode_double(self, size, offset): self._verify_size(size, 8) new_offset = offset + size packed_bytes = self._buffer[offset:new_offset] (value, ) = struct.unpack(b'!d', packed_bytes) return value, new_offset def _decode_float(self, size, offset): self._verify_size(size, 4) new_offset = offset + size packed_bytes = self._buffer[offset:new_offset] (value, ) = struct.unpack(b'!f', packed_bytes) return value, new_offset def _decode_int32(self, size, offset): if size == 0: return 0, offset new_offset = offset + size packed_bytes = self._buffer[offset:new_offset] if size != 4: packed_bytes = packed_bytes.rjust(4, b'\x00') (value, ) = struct.unpack(b'!i', packed_bytes) return value, new_offset def _decode_map(self, size, offset): container = {} for _ in range(size): (key, offset) = self.decode(offset) (value, offset) = self.decode(offset) container[key] = value return container, offset def _decode_pointer(self, size, offset): pointer_size = (size >> 3) + 1 buf = self._buffer[offset:offset + pointer_size] new_offset = offset + pointer_size if pointer_size == 1: buf = byte_from_int(size & 0x7) + buf pointer = struct.unpack(b'!H', buf)[0] + self._pointer_base elif pointer_size == 2: buf = b'\x00' + byte_from_int(size & 0x7) + buf pointer = struct.unpack(b'!I', buf)[0] + 2048 + self._pointer_base elif pointer_size == 3: buf = byte_from_int(size & 0x7) + buf pointer = struct.unpack(b'!I', buf)[0] + 526336 + self._pointer_base else: pointer = struct.unpack(b'!I', buf)[0] + self._pointer_base if self._pointer_test: return pointer, new_offset (value, _) = self.decode(pointer) return value, new_offset def _decode_uint(self, size, offset): new_offset = offset + size uint_bytes = self._buffer[offset:new_offset] return int_from_bytes(uint_bytes), new_offset def _decode_utf8_string(self, size, offset): new_offset = offset + size return self._buffer[offset:new_offset].decode('utf-8'), new_offset _type_decoder = { 1: _decode_pointer, 2: _decode_utf8_string, 3: _decode_double, 4: _decode_bytes, 5: _decode_uint, # uint16 6: _decode_uint, # uint32 7: _decode_map, 8: _decode_int32, 9: _decode_uint, # uint64 10: _decode_uint, # uint128 11: _decode_array, 14: _decode_boolean, 15: _decode_float, } def decode(self, offset): """Decode a section of the data section starting at offset Arguments: offset -- the location of the data structure to decode """ new_offset = offset + 1 ctrl_byte = int_from_byte(self._buffer[offset]) type_num = ctrl_byte >> 5 # Extended type if not type_num: (type_num, new_offset) = self._read_extended(new_offset) try: decoder = self._type_decoder[type_num] except KeyError: raise InvalidDatabaseError('Unexpected type number ({type}) ' 'encountered'.format(type=type_num)) (size, new_offset) = self._size_from_ctrl_byte(ctrl_byte, new_offset, type_num) return decoder(self, size, new_offset) def _read_extended(self, offset): next_byte = int_from_byte(self._buffer[offset]) type_num = next_byte + 7 if type_num < 7: raise InvalidDatabaseError( 'Something went horribly wrong in the decoder. An ' 'extended type resolved to a type number < 8 ' '({type})'.format(type=type_num)) return type_num, offset + 1 def _verify_size(self, expected, actual): if expected != actual: raise InvalidDatabaseError( 'The MaxMind DB file\'s data section contains bad data ' '(unknown data type or corrupt data)') def _size_from_ctrl_byte(self, ctrl_byte, offset, type_num): size = ctrl_byte & 0x1f if type_num == 1 or size < 29: return size, offset if size == 29: size = 29 + int_from_byte(self._buffer[offset]) return size, offset + 1 # Using unpack rather than int_from_bytes as it is faster # here and below. if size == 30: new_offset = offset + 2 size_bytes = self._buffer[offset:new_offset] size = 285 + struct.unpack(b'!H', size_bytes)[0] return size, new_offset new_offset = offset + 3 size_bytes = self._buffer[offset:new_offset] size = struct.unpack(b'!I', b'\x00' + size_bytes)[0] + 65821 return size, new_offset ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1547072470.0 maxminddb-1.5.2/maxminddb/errors.py0000644000175000017500000000034200000000000017205 0ustar00greggreg00000000000000""" maxminddb.errors ~~~~~~~~~~~~~~~~ This module contains custom errors for the MaxMind DB reader """ class InvalidDatabaseError(RuntimeError): """This error is thrown when unexpected data is found in the database.""" ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867133.0 maxminddb-1.5.2/maxminddb/file.py0000644000175000017500000000366100000000000016617 0ustar00greggreg00000000000000"""For internal use only. It provides a slice-like file reader.""" import os try: # pylint: disable=no-name-in-module from multiprocessing import Lock except ImportError: from threading import Lock class FileBuffer(object): """A slice-able file reader""" def __init__(self, database): self._handle = open(database, 'rb') self._size = os.fstat(self._handle.fileno()).st_size if not hasattr(os, 'pread'): self._lock = Lock() def __getitem__(self, key): if isinstance(key, slice): return self._read(key.stop - key.start, key.start) if isinstance(key, int): return self._read(1, key)[0] raise TypeError("Invalid argument type.") def rfind(self, needle, start): """Reverse find needle from start""" pos = self._read(self._size - start - 1, start).rfind(needle) if pos == -1: return pos return start + pos def size(self): """Size of file""" return self._size def close(self): """Close file""" self._handle.close() if hasattr(os, 'pread'): def _read(self, buffersize, offset): """read that uses pread""" # pylint: disable=no-member return os.pread(self._handle.fileno(), buffersize, offset) else: def _read(self, buffersize, offset): """read with a lock This lock is necessary as after a fork, the different processes will share the same file table entry, even if we dup the fd, and as such the same offsets. There does not appear to be a way to duplicate the file table entry and we cannot re-open based on the original path as that file may have replaced with another or unlinked. """ with self._lock: self._handle.seek(offset) return self._handle.read(buffersize) ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867133.0 maxminddb-1.5.2/maxminddb/reader.py0000644000175000017500000002443700000000000017146 0ustar00greggreg00000000000000""" maxminddb.reader ~~~~~~~~~~~~~~~~ This module contains the pure Python database reader and related classes. """ from __future__ import unicode_literals try: import mmap except ImportError: # pylint: disable=invalid-name mmap = None import struct from maxminddb.compat import compat_ip_address, string_type from maxminddb.const import MODE_AUTO, MODE_MMAP, MODE_FILE, MODE_MEMORY, MODE_FD from maxminddb.decoder import Decoder from maxminddb.errors import InvalidDatabaseError from maxminddb.file import FileBuffer class Reader(object): """ Instances of this class provide a reader for the MaxMind DB format. IP addresses can be looked up using the ``get`` method. """ _DATA_SECTION_SEPARATOR_SIZE = 16 _METADATA_START_MARKER = b"\xAB\xCD\xEFMaxMind.com" _ipv4_start = None def __init__(self, database, mode=MODE_AUTO): """Reader for the MaxMind DB file format Arguments: database -- A path to a valid MaxMind DB file such as a GeoIP2 database file, or a file descriptor in the case of MODE_FD. mode -- mode to open the database with. Valid mode are: * MODE_MMAP - read from memory map. * MODE_FILE - read database as standard file. * MODE_MEMORY - load database into memory. * MODE_AUTO - tries MODE_MMAP and then MODE_FILE. Default. * MODE_FD - the param passed via database is a file descriptor, not a path. This mode implies MODE_MEMORY. """ if (mode == MODE_AUTO and mmap) or mode == MODE_MMAP: with open(database, 'rb') as db_file: self._buffer = mmap.mmap(db_file.fileno(), 0, access=mmap.ACCESS_READ) self._buffer_size = self._buffer.size() filename = database elif mode in (MODE_AUTO, MODE_FILE): self._buffer = FileBuffer(database) self._buffer_size = self._buffer.size() filename = database elif mode == MODE_MEMORY: with open(database, 'rb') as db_file: self._buffer = db_file.read() self._buffer_size = len(self._buffer) filename = database elif mode == MODE_FD: self._buffer = database.read() self._buffer_size = len(self._buffer) filename = database.name else: raise ValueError( 'Unsupported open mode ({0}). Only MODE_AUTO, MODE_FILE, ' 'MODE_MEMORY and MODE_FD are supported by the pure Python ' 'Reader'.format(mode)) metadata_start = self._buffer.rfind( self._METADATA_START_MARKER, max(0, self._buffer_size - 128 * 1024)) if metadata_start == -1: self.close() raise InvalidDatabaseError('Error opening database file ({0}). ' 'Is this a valid MaxMind DB file?' ''.format(filename)) metadata_start += len(self._METADATA_START_MARKER) metadata_decoder = Decoder(self._buffer, metadata_start) (metadata, _) = metadata_decoder.decode(metadata_start) self._metadata = Metadata(**metadata) # pylint: disable=bad-option-value self._decoder = Decoder( self._buffer, self._metadata.search_tree_size + self._DATA_SECTION_SEPARATOR_SIZE) self.closed = False def metadata(self): """Return the metadata associated with the MaxMind DB file""" return self._metadata def get(self, ip_address): """Return the record for the ip_address in the MaxMind DB Arguments: ip_address -- an IP address in the standard string notation """ (record, _) = self.get_with_prefix_len(ip_address) return record def get_with_prefix_len(self, ip_address): """Return a tuple with the record and the associated prefix length Arguments: ip_address -- an IP address in the standard string notation """ if isinstance(ip_address, string_type): address = compat_ip_address(ip_address) else: address = ip_address try: packed_address = bytearray(address.packed) except AttributeError: raise TypeError('argument 1 must be a string or ipaddress object') if address.version == 6 and self._metadata.ip_version == 4: raise ValueError( 'Error looking up {0}. You attempted to look up ' 'an IPv6 address in an IPv4-only database.'.format(ip_address)) (pointer, prefix_len) = self._find_address_in_tree(packed_address) if pointer: return self._resolve_data_pointer(pointer), prefix_len return None, prefix_len def _find_address_in_tree(self, packed): bit_count = len(packed) * 8 node = self._start_node(bit_count) node_count = self._metadata.node_count i = 0 while i < bit_count and node < node_count: bit = 1 & (packed[i >> 3] >> 7 - (i % 8)) node = self._read_node(node, bit) i = i + 1 if node == node_count: # Record is empty return 0, i if node > node_count: return node, i raise InvalidDatabaseError('Invalid node in search tree') def _start_node(self, length): if self._metadata.ip_version != 6 or length == 128: return 0 # We are looking up an IPv4 address in an IPv6 tree. Skip over the # first 96 nodes. if self._ipv4_start: return self._ipv4_start node = 0 for _ in range(96): if node >= self._metadata.node_count: break node = self._read_node(node, 0) self._ipv4_start = node return node def _read_node(self, node_number, index): base_offset = node_number * self._metadata.node_byte_size record_size = self._metadata.record_size if record_size == 24: offset = base_offset + index * 3 node_bytes = b'\x00' + self._buffer[offset:offset + 3] elif record_size == 28: offset = base_offset + 3 * index node_bytes = bytearray(self._buffer[offset:offset + 4]) if index: node_bytes[0] = 0x0F & node_bytes[0] else: middle = (0xF0 & node_bytes.pop()) >> 4 node_bytes.insert(0, middle) elif record_size == 32: offset = base_offset + index * 4 node_bytes = self._buffer[offset:offset + 4] else: raise InvalidDatabaseError( 'Unknown record size: {0}'.format(record_size)) return struct.unpack(b'!I', node_bytes)[0] def _resolve_data_pointer(self, pointer): resolved = pointer - self._metadata.node_count + \ self._metadata.search_tree_size if resolved >= self._buffer_size: raise InvalidDatabaseError( "The MaxMind DB file's search tree is corrupt") (data, _) = self._decoder.decode(resolved) return data def close(self): """Closes the MaxMind DB file and returns the resources to the system""" # pylint: disable=unidiomatic-typecheck if type(self._buffer) not in (str, bytes): self._buffer.close() self.closed = True def __exit__(self, *args): self.close() def __enter__(self): if self.closed: raise ValueError('Attempt to reopen a closed MaxMind DB') return self class Metadata(object): """Metadata for the MaxMind DB reader .. attribute:: binary_format_major_version The major version number of the binary format used when creating the database. :type: int .. attribute:: binary_format_minor_version The minor version number of the binary format used when creating the database. :type: int .. attribute:: build_epoch The Unix epoch for the build time of the database. :type: int .. attribute:: database_type A string identifying the database type, e.g., "GeoIP2-City". :type: str .. attribute:: description A map from locales to text descriptions of the database. :type: dict(str, str) .. attribute:: ip_version The IP version of the data in a database. A value of "4" means the database only supports IPv4. A database with a value of "6" may support both IPv4 and IPv6 lookups. :type: int .. attribute:: languages A list of locale codes supported by the databse. :type: list(str) .. attribute:: node_count The number of nodes in the database. :type: int .. attribute:: record_size The bit size of a record in the search tree. :type: int """ # pylint: disable=too-many-instance-attributes def __init__(self, **kwargs): """Creates new Metadata object. kwargs are key/value pairs from spec""" # Although I could just update __dict__, that is less obvious and it # doesn't work well with static analysis tools and some IDEs self.node_count = kwargs['node_count'] self.record_size = kwargs['record_size'] self.ip_version = kwargs['ip_version'] self.database_type = kwargs['database_type'] self.languages = kwargs['languages'] self.binary_format_major_version = kwargs[ 'binary_format_major_version'] self.binary_format_minor_version = kwargs[ 'binary_format_minor_version'] self.build_epoch = kwargs['build_epoch'] self.description = kwargs['description'] @property def node_byte_size(self): """The size of a node in bytes :type: int """ return self.record_size // 4 @property def search_tree_size(self): """The size of the search tree :type: int """ return self.node_count * self.node_byte_size def __repr__(self): args = ', '.join('%s=%r' % x for x in self.__dict__.items()) return '{module}.{class_name}({data})'.format( module=self.__module__, class_name=self.__class__.__name__, data=args) ././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3852544 maxminddb-1.5.2/maxminddb.egg-info/0000755000175000017500000000000000000000000017012 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/maxminddb.egg-info/PKG-INFO0000644000175000017500000001304100000000000020106 0ustar00greggreg00000000000000Metadata-Version: 1.2 Name: maxminddb Version: 1.5.2 Summary: Reader for the MaxMind DB format Home-page: http://www.maxmind.com/ Author: Gregory Oschwald Author-email: goschwald@maxmind.com License: Apache License, Version 2.0 Description: ======================== MaxMind DB Python Module ======================== Description ----------- This is a Python module for reading MaxMind DB files. The module includes both a pure Python reader and an optional C extension. MaxMind DB is a binary file format that stores data indexed by IP address subnets (IPv4 or IPv6). Installation ------------ If you want to use the C extension, you must first install `libmaxminddb `_ C library installed before installing this extension. If the library is not available, the module will fall-back to a pure Python implementation. To install maxminddb, type: .. code-block:: bash $ pip install maxminddb If you are not able to use pip, you may also use easy_install from the source directory: .. code-block:: bash $ easy_install . Usage ----- To use this module, you must first download or create a MaxMind DB file. We provide `free GeoLite2 databases `_. These files must be decompressed with ``gunzip``. After you have obtained a database and imported the module, call ``open_database`` with a path, or file descriptor (in the case of MODE_FD), to the database as the first argument. Optionally, you may pass a mode as the second argument. The modes are exported from ``maxminddb``. Valid modes are: * MODE_MMAP_EXT - use the C extension with memory map. * MODE_MMAP - read from memory map. Pure Python. * MODE_FILE - read database as standard file. Pure Python. * MODE_MEMORY - load database into memory. Pure Python. * MODE_FD - load database into memory from a file descriptor. Pure Python. * MODE_AUTO - try MODE_MMAP_EXT, MODE_MMAP, MODE_FILE in that order. Default. **NOTE**: When using ``MODE_FD``, it is the *caller's* responsibility to be sure that the file descriptor gets closed properly. The caller may close the file descriptor immediately after the ``Reader`` object is created. The ``open_database`` function returns a ``Reader`` object. To look up an IP address, use the ``get`` method on this object. The method will return the corresponding values for the IP address from the database (e.g., a dictionary for GeoIP2/GeoLite2 databases). If the database does not contain a record for that IP address, the method will return ``None``. If you wish to also retrieve the prefix length for the record, use the ``get_with_prefix_len`` method. This returns a tuple containing the record followed by the network prefix length associated with the record. Example ------- .. code-block:: pycon >>> import maxminddb >>> >>> reader = maxminddb.open_database('GeoLite2-City.mmdb') >>> >>> reader.get('1.1.1.1') {'country': ... } >>> >>> reader.get_with_prefix_len('1.1.1.1') ({'country': ... }, 24) >>> >>> reader.close() Exceptions ---------- The module will return an ``InvalidDatabaseError`` if the database is corrupt or otherwise invalid. A ``ValueError`` will be thrown if you look up an invalid IP address or an IPv6 address in an IPv4 database. Requirements ------------ This code requires Python 2.7+ or 3.5+. Older versions are not supported. The C extension requires CPython. The pure Python implementation has been tested with PyPy. On Python 2, the `ipaddress module `_ is required. Versioning ---------- The MaxMind DB Python module uses `Semantic Versioning `_. Support ------- Please report all issues with this code using the `GitHub issue tracker `_ If you are having an issue with a MaxMind service that is not specific to this API, please contact `MaxMind support `_ for assistance. Platform: UNKNOWN Classifier: Development Status :: 5 - Production/Stable Classifier: Environment :: Web Environment Classifier: Intended Audience :: Developers Classifier: Intended Audience :: System Administrators Classifier: License :: OSI Approved :: Apache Software License Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.5 Classifier: Programming Language :: Python :: 3.6 Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python Classifier: Topic :: Internet :: Proxy Servers Classifier: Topic :: Internet Requires-Python: >=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.* ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/maxminddb.egg-info/SOURCES.txt0000644000175000017500000000514300000000000020701 0ustar00greggreg00000000000000HISTORY.rst LICENSE MANIFEST.in README.rst setup.cfg setup.py docs/html/.buildinfo docs/html/genindex.html docs/html/index.html docs/html/objects.inv docs/html/py-modindex.html docs/html/search.html docs/html/searchindex.js docs/html/_sources/index.rst.txt docs/html/_static/basic.css docs/html/_static/contents.png docs/html/_static/doctools.js docs/html/_static/documentation_options.js docs/html/_static/file.png docs/html/_static/jquery-3.4.1.js docs/html/_static/jquery.js docs/html/_static/language_data.js docs/html/_static/minus.png docs/html/_static/navigation.png docs/html/_static/plus.png docs/html/_static/pygments.css docs/html/_static/searchtools.js docs/html/_static/sphinxdoc.css docs/html/_static/underscore-1.3.1.js docs/html/_static/underscore.js extension/maxminddb.c maxminddb/__init__.py maxminddb/compat.py maxminddb/const.py maxminddb/decoder.py maxminddb/errors.py maxminddb/file.py maxminddb/reader.py maxminddb.egg-info/PKG-INFO maxminddb.egg-info/SOURCES.txt maxminddb.egg-info/dependency_links.txt maxminddb.egg-info/top_level.txt tests/decoder_test.py tests/reader_test.py tests/data/test-data/GeoIP2-Anonymous-IP-Test.mmdb tests/data/test-data/GeoIP2-City-Test-Broken-Double-Format.mmdb tests/data/test-data/GeoIP2-City-Test-Invalid-Node-Count.mmdb tests/data/test-data/GeoIP2-City-Test.mmdb tests/data/test-data/GeoIP2-Connection-Type-Test.mmdb tests/data/test-data/GeoIP2-Country-Test.mmdb tests/data/test-data/GeoIP2-DensityIncome-Test.mmdb tests/data/test-data/GeoIP2-Domain-Test.mmdb tests/data/test-data/GeoIP2-Enterprise-Test.mmdb tests/data/test-data/GeoIP2-ISP-Test.mmdb tests/data/test-data/GeoIP2-Precision-Enterprise-Test.mmdb tests/data/test-data/GeoIP2-User-Count-Test.mmdb tests/data/test-data/GeoLite2-ASN-Test.mmdb tests/data/test-data/MaxMind-DB-no-ipv4-search-tree.mmdb tests/data/test-data/MaxMind-DB-string-value-entries.mmdb tests/data/test-data/MaxMind-DB-test-broken-pointers-24.mmdb tests/data/test-data/MaxMind-DB-test-broken-search-tree-24.mmdb tests/data/test-data/MaxMind-DB-test-decoder.mmdb tests/data/test-data/MaxMind-DB-test-ipv4-24.mmdb tests/data/test-data/MaxMind-DB-test-ipv4-28.mmdb tests/data/test-data/MaxMind-DB-test-ipv4-32.mmdb tests/data/test-data/MaxMind-DB-test-ipv6-24.mmdb tests/data/test-data/MaxMind-DB-test-ipv6-28.mmdb tests/data/test-data/MaxMind-DB-test-ipv6-32.mmdb tests/data/test-data/MaxMind-DB-test-metadata-pointers.mmdb tests/data/test-data/MaxMind-DB-test-mixed-24.mmdb tests/data/test-data/MaxMind-DB-test-mixed-28.mmdb tests/data/test-data/MaxMind-DB-test-mixed-32.mmdb tests/data/test-data/MaxMind-DB-test-nested.mmdb tests/data/test-data/maps-with-pointers.raw././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/maxminddb.egg-info/dependency_links.txt0000644000175000017500000000000100000000000023060 0ustar00greggreg00000000000000 ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576867440.0 maxminddb-1.5.2/maxminddb.egg-info/top_level.txt0000644000175000017500000000001200000000000021535 0ustar00greggreg00000000000000maxminddb ././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.401256 maxminddb-1.5.2/setup.cfg0000644000175000017500000000017500000000000015201 0ustar00greggreg00000000000000[aliases] build_html = build_sphinx -b html --build-dir docs sdist = build_html sdist [egg_info] tag_build = tag_date = 0 ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1569616738.0 maxminddb-1.5.2/setup.py0000644000175000017500000001216500000000000015074 0ustar00greggreg00000000000000import os import re import sys # This import is apparently needed for Nose on Red Hat's Python import multiprocessing from distutils.command.build_ext import build_ext from distutils.errors import (CCompilerError, DistutilsExecError, DistutilsPlatformError) from setuptools import setup, Extension cmdclass = {} PYPY = hasattr(sys, 'pypy_version_info') JYTHON = sys.platform.startswith('java') requirements = [] if sys.version_info[0] == 2 or (sys.version_info[0] == 3 and sys.version_info[1] < 3): requirements.append('ipaddress') if os.environ.get('SNYK_TOKEN'): with open('requirements.txt', 'w') as f: for r in requirements: f.write(r + '\n') compile_args = ['-Wall', '-Wextra'] if sys.version_info[0] == 2: compile_args.append('-fno-strict-aliasing') ext_module = [ Extension( 'maxminddb.extension', libraries=['maxminddb'], sources=['extension/maxminddb.c'], extra_compile_args=compile_args, ) ] # Cargo cult code for installing extension with pure Python fallback. # Taken from SQLAlchemy, but this same basic code exists in many modules. ext_errors = (CCompilerError, DistutilsExecError, DistutilsPlatformError) class BuildFailed(Exception): def __init__(self): self.cause = sys.exc_info()[1] # work around py 2/3 different syntax class ve_build_ext(build_ext): # This class allows C extension building to fail. def run(self): try: build_ext.run(self) except DistutilsPlatformError: raise BuildFailed() def build_extension(self, ext): try: build_ext.build_extension(self, ext) except ext_errors: raise BuildFailed() except ValueError: # this can happen on Windows 64 bit, see Python issue 7511 if "'path'" in str(sys.exc_info()[1]): # works with both py 2/3 raise BuildFailed() raise cmdclass['build_ext'] = ve_build_ext # ROOT = os.path.dirname(__file__) with open(os.path.join(ROOT, 'README.rst'), 'rb') as fd: README = fd.read().decode('utf8') with open(os.path.join(ROOT, 'maxminddb', '__init__.py'), 'rb') as fd: maxminddb_text = fd.read().decode('utf8') LICENSE = re.compile(r".*__license__ = '(.*?)'", re.S).match(maxminddb_text).group(1) VERSION = re.compile(r".*__version__ = '(.*?)'", re.S).match(maxminddb_text).group(1) def status_msgs(*msgs): print('*' * 75) for msg in msgs: print(msg) print('*' * 75) def find_packages(location): packages = [] for pkg in ['maxminddb']: for _dir, subdirectories, files in (os.walk(os.path.join( location, pkg))): if '__init__.py' in files: tokens = _dir.split(os.sep)[len(location.split(os.sep)):] packages.append(".".join(tokens)) return packages def run_setup(with_cext): kwargs = {} if with_cext: kwargs['ext_modules'] = ext_module setup(name='maxminddb', version=VERSION, author='Gregory Oschwald', author_email='goschwald@maxmind.com', description='Reader for the MaxMind DB format', long_description=README, url='http://www.maxmind.com/', packages=find_packages('.'), package_data={'': ['LICENSE']}, package_dir={'maxminddb': 'maxminddb'}, python_requires='>=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*', include_package_data=True, install_requires=requirements, tests_require=['nose'], test_suite='nose.collector', license=LICENSE, cmdclass=cmdclass, classifiers=[ 'Development Status :: 5 - Production/Stable', 'Environment :: Web Environment', 'Intended Audience :: Developers', 'Intended Audience :: System Administrators', 'License :: OSI Approved :: Apache Software License', 'Programming Language :: Python :: 2.7', 'Programming Language :: Python :: 3', 'Programming Language :: Python :: 3.5', 'Programming Language :: Python :: 3.6', 'Programming Language :: Python :: 3.7', 'Programming Language :: Python', 'Topic :: Internet :: Proxy Servers', 'Topic :: Internet', ], **kwargs) if PYPY or JYTHON: run_setup(False) status_msgs("WARNING: Disabling C extension due to Python platform.", "Plain-Python build succeeded.") else: try: run_setup(True) except BuildFailed as exc: status_msgs( exc.cause, "WARNING: The C extension could not be compiled, " + "speedups are not enabled.", "Failure information, if any, is above.", "Retrying the build without the C extension now.") run_setup(False) status_msgs( "WARNING: The C extension could not be compiled, " + "speedups are not enabled.", "Plain-Python build succeeded.") ././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3852544 maxminddb-1.5.2/tests/0000755000175000017500000000000000000000000014517 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000003400000000000011452 xustar000000000000000028 mtime=1576867440.3772535 maxminddb-1.5.2/tests/data/0000755000175000017500000000000000000000000015430 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000003300000000000011451 xustar000000000000000027 mtime=1576867440.401256 maxminddb-1.5.2/tests/data/test-data/0000755000175000017500000000000000000000000017316 5ustar00greggreg00000000000000././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Anonymous-IP-Test.mmdb0000644000175000017500000001040700000000000024417 0ustar00greggreg00000000000000@@@@@X @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@.@/@0@1@2@3@4@5@6@7@8@9@:@;@<@=@>@?@@@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@QIR@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@abc@d@ef@g@0hi@jpk@l@m@n@@oA@@q@r@s@tu@v@@w@xy@@z{@@|}@@~@@@@@@@@d@@0@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@0@@@@0@@@@@@@@@@@0@@@@@@@0@@@@@@@@@@@@@@@@@@@@H@5@@ @@@@@@@@@@@@ @@@@@0@0@ @@ @ @@@@@@@@@@@0@@@@@@0@@ !@"@#@$(@%&@'@@0@)*@+@@,@-.@@/@01@2@@34@0@6@@7@89@:@;@<@=@>@?@@@A@@B@C@DE@F@G@@000@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@`Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@@@@@@@@@@@@@@@@@@0@@@@@@@@@@@@@@@@@@@00000000`0@@@@@@@@@@0@`@(@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@@@)@*@+@,0-.0@/0@Lis_anonymousPis_anonymous_vpn     Pis_tor_exit_node    -   Sis_hosting_provider      N Ois_public_proxy  -    q MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeSGeoIP2-Anonymous-IPKdescriptionBen]2GeoIP2 Anonymous IP Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_count0Krecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-City-Test-Broken-Double-Format.mmdb0000644000175000017500000004776600000000000026727 0ustar00greggreg00000000000000      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ|RSTUVWXYZ[\]^_`abcde~fghijklmnopqrstuvwxyz{|}   8  ` ` /{bC-&      !"#$%'()*+,./0126345789:;<=>?@ABDEFRGHIJKLMNOPQ.STUVWXYZ[\]^_`acdefghijklmnopqrstuvwxyz}~`\[P`SS$     S4%S$" !S#$&-'*()+,.1/0S23S5A6=7:89;<>?@SBICFDE2GHJMKLNOQRSTUVWXYZ`]^_`abcdefghijk{lmnoptqrsuxvwfyz|}~."k0$Y.C$     ?! "#%4&-'*()+,.1/0 235<6978:;=@>?ABDcETFMGJHIKLNQOPRS$U\VYWX!_Z[]`^_abdselfighjkfmpnoqr"t{uxvwyz|}~ "#z."" $k"$%&k  " H )"' !#&$%f'(*9+2,/-..013645"78":A;><=?@BECDFGIhJYKRLOMNPQSVTUWX(Za[^\]_`becdfg$ixjqknlm$oprust"vwyz}{|~0$%$")e*"""""     "O0!" "")#&$%'(*-+,./1@293645$78:=;<>?"AHBECDFGILJKMN"PoQ`RYSVTUWX+CZ][\^_ahbecdfgiljk+Cmn pqxrust"vwy|z{}~+,DcityJgeoname_id(EEnamesBenGBoxfordIcontinentDcodeBEU _r, BdeFEuropaBenFEuropeBes GBfr QBjaOヨーロッパEpt-BR GBruLЕвропаEzh-CNF欧洲Gcountry (5Tis_in_european_unionHiso_codeBGB BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス u Bru\Великобритания F英国HlocationOaccuracy_radiusdHlatitudeg51.7500Ilongitudeg-1.2500Itime_zoneMEurope/LondonFpostal 3COX1Rregistered_country . BFR BdeJFrankreichBenFFranceBesGFranciaBfr!BjaUフランス共和国 uGFrançaBruNФранция F法国Lsubdivisions _ CENG BenGEnglandBesJInglaterraBfrJAngleterre u"u 2a CWBK BenNWest BerkshireBru]Западный Беркшир L西伯克郡 ( 3BAS _r+ BdeEAsienBenDAsiaBes#BfrDAsieBjaIアジア uEÁsiaBruHАзия F亚洲  BBT BdeFBhutanBen#UBesFButánBfr#UBjaRブータン王国 uFButãoBruJБутан F不丹!W!a!sg27.5000!g90.5000!LAsia/Thimphu!  /U BRO BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア uHRomêniaBruNРумыния L罗马尼亚FtraitsRis_anonymous_proxy  (W BdeFLondonBen$BesGLondresBfr$BjaLロンドン u$BruLЛондон ( 2 !W!ad!sg51.5142!g-0.0931!!! _e BUS BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 u%BruFСША F美国"H"W $u ( 2 !W!a!s$!$!!!$"H%e $u ( 2 !W!a !s$!$!!!$"H%e  )j BdeJLinköpingBen%Bfr%BjaXリンシェーピング I林雪平 ( 2 ( BSE BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 uGSuéciaBruLШвеция F瑞典!W!aL!sg58.4167!g15.6167!PEurope/Stockholm! ,T BDE BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 uHAlemanhaBruPГермания F德国"H ( AE BenUÖstergötland CountyBfrWComté d'Östergötland   BdeKChángchūnBenIChangchunBfr'BjaI長春市BruNЧанчунь F长春 ("  BCN BdeEChinaBen'Bes'BfrEChineBjaF中国 u'BruJКитай (!W!ad!se43.88!h125.3228!KAsia/Harbin!'"H  B22 BenKJilin Sheng F吉林 (" 8 BPH BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr(BjaXフィリピン共和国 u(BruRФилиппины I菲律宾!W!ay!sb13!c122!KAsia/Manila! 3E34021!(Srepresented_country _e BUS $DtypeHmilitary  X$ BenFMiltonBruNМильтон ( 3BNA _r- BdeKNordamerikaBenMNorth AmericaBesRAmérica del NorteBfrQAmérique du NordBjaO北アメリカ uQAmérica do NorteBru]Северная Америка I北美洲 $!W!a!sg47.2513!i-122.3149Jmetro_code3!SAmerica/Los_Angeles! 3E98354! "H X_ BWA BenJWashingtonBes(BfrSÉtat de WashingtonBjaRワシントン州BruRВашингтон L华盛顿州 (" e BJP BdeEJapanBen(5BesFJapónBfrEJaponBjaF日本 uFJapãoBruLЯпония (W!W!ad!sh35.68536!i139.75309!JAsia/Tokyo!(# (" A BKR BdeNRepublik KoreaBenKSouth KoreaBesTCorea, República deBfrMCorée du SudBjaL大韓民国 uVCoréia, República daBruUЮжная Корея F韩国!W!ad!sb37!e127.5!JAsia/Seoul!( (" t BTW BdeFTaiwanBen(BesGTaiwánBfrGTaïwanBjaF台湾 u(BruNТайвань (!W!ad!sb24!c121!KAsia/Taipei!( ("  BCN Bde'BenZPeople's Republic of ChinaBesXRepública Popular ChinaBfr( Bja( u'Bru( (!W!ad!sb35!c105!( (" R BHK BdeHHongkongBenIHong KongBes(Bfr(BjaF香港 u(BruNГонконг (!W!ad!se22.25!i114.16667!NAsia/Hong_Kong!( ( 2 / BNO BdeHNorwegenBenFNorwayBesGNoruegaBfrHNorvègeBjaUノルウェー王国 u(LBruPНорвегия F挪威!W!ad!sb62!b10!KEurope/Oslo!($ (" ~ BIL BdeFIsraelBen(Bes(BfrGIsraëlBjaRイスラエル国 u(BruNИзраиль I以色列!W!ad!sd31.5!e34.75!NAsia/Jerusalem!( ( 2 !!W!ad!sb46!a2!LEurope/Paris!! ( 2 ( BCH BdeGSchweizBenKSwitzerlandBesESuizaBfrFSuisseBjaOスイス連邦 uGSuíçaBruRШвейцария F瑞士!W!ad!sh47.00016!g8.01427!MEurope/Zurich!( ( 2 & !W!ad!sb62!b15!&!& (" m BBH BdeGBahrainBen(rBesHBahréinBfrHBahreïnBjaOバーレーン u(rBruNБахрейн F巴林!W!ad!sb26!d50.5!LAsia/Bahrain!(` ( 2 Z BRU BdeHRusslandBenFRussiaBesERusiaBfrFRussieBjaIロシア uGRússiaBruLРоссия I俄罗斯!W!ad!sb60!c100!( ( 2  /P BPL BdeEPolenBenFPolandBesGPoloniaBfrGPologneBjaXポーランド共和国 uHPolôniaBruLПольша F波兰!W!ad!sb52!b20!MEurope/Warsaw!( ( 2 &!W!ad!sd51.5!d10.5!MEurope/Berlin!& ( 2 0s BIT BdeGItalienBenEItalyBesFItaliaBfrFItalieBjaUイタリア共和国 uGItáliaBruLИталия I意大利!W!ad!sh42.83333!h12.83333!KEurope/Rome!( ] ( 2  - BFI BdeHFinnlandBenGFinlandBesIFinlandiaBfrHFinlandeBja[フィンランド共和国 uJFinlândiaBruRФинляндия F芬兰!W!ad!sb64!b26!OEurope/Helsinki!(  ( 2  @ BBY BdeMWeißrusslandBenGBelarusBesKBielorrusiaBfrLBiélorussieBjaXベラルーシ共和国 uMBielo-RússiaBruPБеларусь L白俄罗斯!W!ad!sb53!b28!LEurope/Minsk!( ( 2 . BCZ BdeUTschechische RepublikBenNCzech RepublicBesPRepública ChecaBfrITchéquieBjaRチェコ共和国 u( Bru]Чешская Республика O捷克共和国!W!ad!se49.75!b15!MEurope/Prague!( ("  BIR BdeZIran (Islamische Republik)BenDIranBes\Irán (República Islámica)Bfr]Iran (République islamique de)Bja]イラン・イスラム共和国 u\República Islâmica do IrãBruHИран X伊朗伊斯兰共和国!W!ad!sb32!b53!KAsia/Tehran!( t ( 2  g BUA BdeGUkraineBen(BesGUcraniaBfr(BjaXウクライナ共和国 uHUcrâniaBruNУкраина I乌克兰!W!ad!sb49!b32!( ( 2 !W!ad!sh54.75844!h-2.69531!!! ( 2  BHU BdeFUngarnBenGHungaryBesHHungríaBfrGHongrieBjaXハンガリー共和国 uGHungriaBruNВенгрия I匈牙利!W!ad!sb47!b20!OEurope/Budapest!(E ( 2!W!ad!sh48.69096!g9.14062!LEurope/Vaduz ( 2 &O BES BdeGSpanienBenESpainBesGEspañaBfrGEspagneBjaLスペイン uGEspanhaBruNИспания I西班牙!W!ad!sb40!b-4!(' ( 2  . BBG BdeIBulgarienBenHBulgariaBes(BfrHBulgarieBjaXブルガリア共和国 uIBulgáriaBruPБолгария L保加利亚!W!ad!sb43!b25!LEurope/Sofia!( ( 2 #!W!ad!sb46!b25!PEurope/Bucharest!# ( 2 *¹ BBE BdeGBelgienBenGBelgiumBesHBélgicaBfrHBelgiqueBjaRベルギー王国 u(BruNБельгия I比利时!W!ad!sh50.83333!a4!OEurope/Brussels!( (" + BTR BdeGTürkeiBenFTurkeyBesHTurquíaBfrGTurquieBjaRトルコ共和国 uGTurquiaBruLТурция I土耳其!W!ad!sh39.05901!h34.91155!OEurope/Istanbul!(M ( 2 *s BAT BdeKÖsterreichBenGAustriaBes($BfrHAutricheBja[オーストリア共和国 uHÁustriaBruNАвстрия I奥地利!W!ad!sh47.33333!h13.33333!MEurope/Vienna!( ( 2  BAL BdeHAlbanienBenGAlbaniaBes(BfrGAlbanieBjaXアルバニア共和国 uHAlbâniaBruNАлбания O阿尔巴尼亚!W!ad!sb41!b20!MEurope/Tirane!( (" & BLB BdeGLibanonBenGLebanonBesGLíbanoBfrELibanBjaUレバノン共和国 u(BruJЛиван I黎巴嫩!W!ad!sh33.83333!h35.83333!KAsia/Beirut!(n ( 2 ) BNL BdeKNiederlandeBenKNetherlandsBesGHolandaBfrHPays-BasBjaRオランダ王国 uNPaíses BaixosBruTНидерланды F荷兰!W!ad!sd52.5!d5.75!PEurope/Amsterdam!( (" [ BKW BdeFKuwaitBen(Bes(BfrGKoweïtBjaOクウェート u(BruLКувейт I科威特!W!ad!sd29.5!e47.75!KAsia/Kuwait!( ("  BSA BdeMSaudi-ArabienBenLSaudi ArabiaBesNArabia SauditaBfrOArabie saouditeBja[サウジアラビア王国 uOArábia SauditaBru]Саудовская Аравия O沙特阿拉伯!W!ad!sb25!b45!KAsia/Riyadh!(n ( 2 _L BRS BdeGSerbienBenFSerbiaBes(tBfrFSerbieBjaLセルビア uGSérviaBruLСербия L塞尔维亚!W!ad!sh44.81892!h20.45998!OEurope/Belgrade!(W ("  BJO BdeIJordanienBen[Hashemite Kingdom of JordanBesHJordaniaBfrHJordanieBja]ヨルダン・ハシミテ王国 uIJordâniaBruPИордания F约旦!W!ad!sb31!b36!JAsia/Amman!( ( 3BAF _r* BdeFAfrikaBenFAfricaBesGÁfricaBfrGAfriqueBjaLアフリカ u(BruLАфрика F非洲 ! BLY Bde]Libysch-Arabische DschamahirijaBenELibyaBesXLibia, República ÁrabeBfrELibyeBja] 社会主義人民リビア・アラブ国 uXLíbia Árabe JamahiriyaBruJЛивия [阿拉伯利比亚民众国!W!ad!sb28!b17!NAfrica/Tripoli!(0 ( 2 -8 BIE BdeFIrlandBenGIrelandBesURepública de IrlandaBfrGIrlandeBjaRアイルランド uGIrlandaBruPИрландия I爱尔兰!W!ad!sb53!b-8!MEurope/Dublin!(5 (" l BAZ BdeMAserbaidschanBenJAzerbaijanBesKAzerbaiyánBfrLAzerbaïdjanBja]アゼルバイジャン共和国 uKAzerbaijãoBruVАзербайджан L阿塞拜疆!W!ad!sd40.5!d47.5!IAsia/Baku!( (" n BAE Bde\Vereinigte Arabische EmirateBenTUnited Arab EmiratesBesWEmiratos Árabes UnidosBfrTÉmirats Arabes UnisBjaXアラブ首長国連邦 uWEmirados Árabes UnidosBru]Объединенные Арабские Эмираты X阿拉伯联合酋长国!W!ad!sb24!b54!JAsia/Dubai!( ("  BAM BdeHArmenienBenGArmeniaBes(BfrHArménieBjaXアルメニア共和国 uHArmêniaBruNАрмения L亚美尼亚!W!ad!sb40!b45!LAsia/Yerevan!( ( 2 (8 BDK BdeIDänemarkBenGDenmarkBesIDinamarcaBfrHDanemarkBjaUデンマーク王国 u(BruJДания F丹麦!W!ad!sb56!b10!QEurope/Copenhagen!( ( 2 .k BIM BdeIInsel ManBenKIsle of ManBesKIsla de ManBfrKÎle de ManBjaIマン島 uKIlha de ManBruMМэн, о-в F曼岛!W!ad!se54.25!d-4.5!REurope/Isle_of_Man!(M ( 2 $B BGI BdeIGibraltarBen(Bes(Bfr(BjaRジブラルタル u(BruRГибралтар!W!ad!sh36.13333!e-5.35!PEurope/Gibraltar!(MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeKGeoIP2-CityKdescriptionBen]?GeoIP2 City Test Broken Double Format Database (fake GeoIP2 data, for example purposes only)BzhO小型数据库Jip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-City-Test-Invalid-Node-Count.mmdb0000644000175000017500000005056300000000000026375 0ustar00greggreg00000000000000      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ|RSTUVWXYZ[\]^_`abcde~fghijklmnopqrstuvwxyz{|}   >  f f 7{bC-&      !"#$%'()*+,./0126345789:;<=>?@ABDEFRGHIJKLMNOPQ9STUVWXYZ[\]^_`acdefghijklmnopqrstuvwxyz0}~`\[P`hhB     h4%hB" !h#$&-'*()+,.1/0h23h5A6=7:89;<>?@hBICFDEfGHJMKLNOQRSTUVWXYZ`]^_`abcdefghijk{lmnoptqrsuxvwyzK|}~5cO:K|5O:Oh|KOK|O7OKC$     5 5!  "# %4&-'*()O+,|.1/0!235<6978O:;=@>?ABDcETFMGJHIKL NQOPRSU\VYWX"\Z[|]`^_5abdselfighjkmpnoqr#t{uxvwyz |}~| K#$||#!%&OOK5O#K&KK&'O    H )O") !#&$%'(5*9+2,/-.01|364578:A;><=?@|BECDFGKIhJYKRLOMNKPQSVTUhWX)Za[^\]_` becdOfg%&ixjqknlmoprust#vw5yz}{|~ c|&|OKOKO|*||+####    5 O0!#O ")#&$%'(*-+,|./|1@293645%&78 :=;<O>?AHBECDOFG|ILJKMNPoQ`RYSVTU5WX,Z][\^_|ahbecdOfgiljk,mn!pqxrust#vw|y|z{}~|-aO.DcityJgeoname_id(EEnamesBenGBoxfordIcontinentDcodeBEU _r, BdeFEuropaBenFEuropeBes GBfr QBjaOヨーロッパEpt-BR GBruLЕвропаEzh-CNF欧洲Gcountry (5Tis_in_european_unionHiso_codeBGB BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス u Bru\Великобритания F英国HlocationOaccuracy_radiusdHlatitudeh@IIlongitudehItime_zoneMEurope/LondonFpostal 3COX1Rregistered_country . BFR BdeJFrankreichBenFFranceBesGFranciaBfr!BjaUフランス共和国 uGFrançaBruNФранция F法国Lsubdivisions _ CENG BenGEnglandBesJInglaterraBfrJAngleterre u"w 2a CWBK BenNWest BerkshireBru]Западный Беркшир L西伯克郡 ( 3BAS _r+ BdeEAsienBenDAsiaBes#BfrDAsieBjaIアジア uEÁsiaBruHАзия F亚洲  BBT BdeFBhutanBen#WBesFButánBfr#WBjaRブータン王国 uFButãoBruJБутан F不丹!W!a!sh@;!h@V!LAsia/Thimphu!  /U BRO BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア uHRomêniaBruNРумыния L罗马尼亚FtraitsRis_anonymous_proxy  (W BdeFLondonBen$BesGLondresBfr$BjaLロンドン u$BruLЛондон ( 2 !W!ad!sh@IN;6!hfA!!! _e BUS BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 u%BruFСША F美国"J"Y $y ( 2 !W!a!s$!$!!!$"J%k $y ( 2 !W!a !s$!$!!!$"J%k  )j BdeJLinköpingBen%Bfr%BjaXリンシェーピング I林雪平 ( 2 ( BSE BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 uGSuéciaBruLШвеция F瑞典!W!aL!sh@M5Vl!!h@/;6!PEurope/Stockholm! ,T BDE BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 uHAlemanhaBruPГермания F德国"J ( AE BenUÖstergötland CountyBfrWComté d'Östergötland   BdeKChángchūnBenIChangchunBfr'BjaI長春市BruNЧанчунь F长春 ("  BCN BdeEChinaBen'Bes'BfrEChineBjaF中国 u'BruJКитай (!W!ad!sh@E =q!h@_TTɆ!KAsia/Harbin!'"J  B22 BenKJilin Sheng F吉林 (" 8 BPH BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr(BjaXフィリピン共和国 u(BruRФилиппины I菲律宾!W!ay!sh@*!h@^!KAsia/Manila! 3E34021!(Srepresented_country _e BUS $DtypeHmilitary  X$ BenFMiltonBruNМильтон ( 3BNA _r- BdeKNordamerikaBenMNorth AmericaBesRAmérica del NorteBfrQAmérique du NordBjaO北アメリカ uQAmérica do NorteBru]Северная Америка I北美洲 $!W!a!sh@G*0!h^'RT`Jmetro_code3!SAmerica/Los_Angeles! 3E98354! "J X_ BWA BenJWashingtonBes(BfrSÉtat de WashingtonBjaRワシントン州BruRВашингтон L华盛顿州 (" e BJP BdeEJapanBen(KBesFJapónBfrEJaponBjaF日本 uFJapãoBruLЯпония (m!W!ad!sh@A׹`H!h@axP3:!JAsia/Tokyo!(9 (" A BKR BdeNRepublik KoreaBenKSouth KoreaBesTCorea, República deBfrMCorée du SudBjaL大韓民国 uVCoréia, República daBruUЮжная Корея F韩国!W!ad!sh@B!h@_!JAsia/Seoul!( (" t BTW BdeFTaiwanBen(BesGTaiwánBfrGTaïwanBjaF台湾 u(BruNТайвань (!W!ad!sh@8!h@^@!KAsia/Taipei!( ("  BCN Bde'BenZPeople's Republic of ChinaBesXRepública Popular ChinaBfr(Bja( u'Bru(( (!W!ad!sh@A!h@Z@!(4 (" R BHK BdeHHongkongBenIHong KongBes(Bfr(BjaF香港 u(BruNГонконг (!W!ad!sh@6@!h@\[!NAsia/Hong_Kong!( ( 2 / BNO BdeHNorwegenBenFNorwayBesGNoruegaBfrHNorvègeBjaUノルウェー王国 u(BruPНорвегия F挪威!W!ad!sh@O!h@$!KEurope/Oslo!(Z (" ~ BIL BdeFIsraelBen(Bes(BfrGIsraëlBjaRイスラエル国 u(BruNИзраиль I以色列!W!ad!sh@?!h@A`!NAsia/Jerusalem!( ( 2 !!W!ad!sh@G!h@!LEurope/Paris!! ( 2 ( BCH BdeGSchweizBenKSwitzerlandBesESuizaBfrFSuisseBjaOスイス連邦 uGSuíçaBruRШвейцария F瑞士!W!ad!sh@G>-b9!h@ Ne!MEurope/Zurich!( ( 2 &!W!ad!sh@O!h@.!&!& (" m BBH BdeGBahrainBen(BesHBahréinBfrHBahreïnBjaOバーレーン u(BruNБахрейн F巴林!W!ad!sh@:!h@I@!LAsia/Bahrain!( ( 2 Z BRU BdeHRusslandBenFRussiaBesERusiaBfrFRussieBjaIロシア uGRússiaBruLРоссия I俄罗斯!W!ad!sh@N!h@Y!( f ( 2  /P BPL BdeEPolenBenFPolandBesGPoloniaBfrGPologneBjaXポーランド共和国 uHPolôniaBruLПольша F波兰!W!ad!sh@J!h@4!MEurope/Warsaw!( ( 2 &!W!ad!sh@I!h@%!MEurope/Berlin!& ( 2 0s BIT BdeGItalienBenEItalyBesFItaliaBfrFItalieBjaUイタリア共和国 uGItáliaBruLИталия I意大利!W!ad!sh@EjcI!h@):э&!KEurope/Rome!( ( 2  - BFI BdeHFinnlandBenGFinlandBesIFinlandiaBfrHFinlandeBja[フィンランド共和国 uJFinlândiaBruRФинляндия F芬兰!W!ad!sh@P!h@:!OEurope/Helsinki!( ( 2  @ BBY BdeMWeißrusslandBenGBelarusBesKBielorrusiaBfrLBiélorussieBjaXベラルーシ共和国 uMBielo-RússiaBruPБеларусь L白俄罗斯!W!ad!sh@J!h@<!LEurope/Minsk!( c ( 2 . BCZ BdeUTschechische RepublikBenNCzech RepublicBesPRepública ChecaBfrITchéquieBjaRチェコ共和国 u( uBru]Чешская Республика O捷克共和国!W!ad!sh@H!h@.!MEurope/Prague!( 4 ("  BIR BdeZIran (Islamische Republik)BenDIranBes\Irán (República Islámica)Bfr]Iran (République islamique de)Bja]イラン・イスラム共和国 u\República Islâmica do IrãBruHИран X伊朗伊斯兰共和国!W!ad!sh@@!h@J!KAsia/Tehran!(! ( 2  g BUA BdeGUkraineBen(OBesGUcraniaBfr(OBjaXウクライナ共和国 uHUcrâniaBruNУкраина I乌克兰!W!ad!sh@H!h@@!(= ( 2 !W!ad!sh@Ka7!htr!!! ( 2  BHU BdeFUngarnBenGHungaryBesHHungríaBfrGHongrieBjaXハンガリー共和国 uGHungriaBruNВенгрия I匈牙利!W!ad!sh@G!h@4!OEurope/Budapest!( ( 2!W!ad!sh@HXq`l !h@"GX:S!LEurope/Vaduz ( 2 &O BES BdeGSpanienBenESpainBesGEspañaBfrGEspagneBjaLスペイン uGEspanhaBruNИспания I西班牙!W!ad!sh@D!h!( ( 2  . BBG BdeIBulgarienBenHBulgariaBes(BfrHBulgarieBjaXブルガリア共和国 uIBulgáriaBruPБолгария L保加利亚!W!ad!sh@E!h@9!LEurope/Sofia!( ( 2 #!W!ad!sh@G!h@9!PEurope/Bucharest!# ( 2 *¹ BBE BdeGBelgienBenGBelgiumBesHBélgicaBfrHBelgiqueBjaRベルギー王国 u(BruNБельгия I比利时!W!ad!sh@IjcI!h@!OEurope/Brussels!( (" + BTR BdeGTürkeiBenFTurkeyBesHTurquíaBfrGTurquieBjaRトルコ共和国 uGTurquiaBruLТурция I土耳其!W!ad!sh@C!h@AtU!OEurope/Istanbul!(J ( 2 *s BAT BdeKÖsterreichBenGAustriaBes(!BfrHAutricheBja[オーストリア共和国 uHÁustriaBruNАвстрия I奥地利!W!ad!sh@GcI!h@*:э&!MEurope/Vienna!( ( 2  BAL BdeHAlbanienBenGAlbaniaBes(BfrGAlbanieBjaXアルバニア共和国 uHAlbâniaBruNАлбания O阿尔巴尼亚!W!ad!sh@D!h@4!MEurope/Tirane!( (" & BLB BdeGLibanonBenGLebanonBesGLíbanoBfrELibanBjaUレバノン共和国 u(BruJЛиван I黎巴嫩!W!ad!sh@@ꪎcI!h@AꪎcI!KAsia/Beirut!(w ( 2 ) BNL BdeKNiederlandeBenKNetherlandsBesGHolandaBfrHPays-BasBjaRオランダ王国 uNPaíses BaixosBruTНидерланды F荷兰!W!ad!sh@J@!h@!PEurope/Amsterdam!( (" [ BKW BdeFKuwaitBen(Bes(BfrGKoweïtBjaOクウェート u(BruLКувейт I科威特!W!ad!sh@=!h@G!KAsia/Kuwait!( ("  BSA BdeMSaudi-ArabienBenLSaudi ArabiaBesNArabia SauditaBfrOArabie saouditeBja[サウジアラビア王国 uOArábia SauditaBru]Саудовская Аравия O沙特阿拉伯!W!ad!sh@9!h@F!KAsia/Riyadh!( ( 2 _L BRS BdeGSerbienBenFSerbiaBes(BfrFSerbieBjaLセルビア uGSérviaBruLСербия L塞尔维亚!W!ad!sh@Fh^)!h@4u?h!OEurope/Belgrade!({ ("  BJO BdeIJordanienBen[Hashemite Kingdom of JordanBesHJordaniaBfrHJordanieBja]ヨルダン・ハシミテ王国 uIJordâniaBruPИордания F约旦!W!ad!sh@?!h@B!JAsia/Amman!(# ( 3BAF _r* BdeFAfrikaBenFAfricaBesGÁfricaBfrGAfriqueBjaLアフリカ u(BruLАфрика F非洲 ! BLY Bde]Libysch-Arabische DschamahirijaBenELibyaBesXLibia, República ÁrabeBfrELibyeBja] 社会主義人民リビア・アラブ国 uXLíbia Árabe JamahiriyaBruJЛивия [阿拉伯利比亚民众国!W!ad!sh@<!h@1!NAfrica/Tripoli!(` ( 2 -8 BIE BdeFIrlandBenGIrelandBesURepública de IrlandaBfrGIrlandeBjaRアイルランド uGIrlandaBruPИрландия I爱尔兰!W!ad!sh@J!h !MEurope/Dublin!(q (" l BAZ BdeMAserbaidschanBenJAzerbaijanBesKAzerbaiyánBfrLAzerbaïdjanBja]アゼルバイジャン共和国 uKAzerbaijãoBruVАзербайджан L阿塞拜疆!W!ad!sh@D@!h@G!IAsia/Baku!(6 (" n BAE Bde\Vereinigte Arabische EmirateBenTUnited Arab EmiratesBesWEmiratos Árabes UnidosBfrTÉmirats Arabes UnisBjaXアラブ首長国連邦 uWEmirados Árabes UnidosBru]Объединенные Арабские Эмираты X阿拉伯联合酋长国!W!ad!sh@8!h@K!JAsia/Dubai!( ("  BAM BdeHArmenienBenGArmeniaBes(qBfrHArménieBjaXアルメニア共和国 uHArmêniaBruNАрмения L亚美尼亚!W!ad!sh@D!h@F!LAsia/Yerevan!(S ( 2 (8 BDK BdeIDänemarkBenGDenmarkBesIDinamarcaBfrHDanemarkBjaUデンマーク王国 u(9BruJДания F丹麦!W!ad!sh@L!h@$!QEurope/Copenhagen!( ( 2 .k BIM BdeIInsel ManBenKIsle of ManBesKIsla de ManBfrKÎle de ManBjaIマン島 uKIlha de ManBruMМэн, о-в F曼岛!W!ad!sh@K !h!REurope/Isle_of_Man!( ( 2 $B BGI BdeIGibraltarBen( Bes( Bfr( BjaRジブラルタル u( BruRГибралтар!W!ad!sh@Bɰ!hffffff!PEurope/Gibraltar!( }MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeKGeoIP2-CityKdescriptionBen]=GeoIP2 City Test Invalid Node Count Database (fake GeoIP2 data, for example purposes only)BzhO小型数据库Jip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-City-Test.mmdb0000644000175000017500000005053700000000000023041 0ustar00greggreg00000000000000      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ|RSTUVWXYZ[\]^_`abcde~fghijklmnopqrstuvwxyz{|}   >  f f 7{bC-&      !"#$%'()*+,./0126345789:;<=>?@ABDEFRGHIJKLMNOPQ9STUVWXYZ[\]^_`acdefghijklmnopqrstuvwxyz0}~`\[P`hhB     h4%hB" !h#$&-'*()+,.1/0h23h5A6=7:89;<>?@hBICFDEfGHJMKLNOQRSTUVWXYZ`]^_`abcdefghijk{lmnoptqrsuxvwyzK|}~5cO:K|5O:Oh|KOK|O7OKC$     5 5!  "# %4&-'*()O+,|.1/0!235<6978O:;=@>?ABDcETFMGJHIKL NQOPRSU\VYWX"\Z[|]`^_5abdselfighjkmpnoqr#t{uxvwyz |}~| K#$||#!%&OOK5O#K&KK&'O    H )O") !#&$%'(5*9+2,/-.01|364578:A;><=?@|BECDFGKIhJYKRLOMNKPQSVTUhWX)Za[^\]_` becdOfg%&ixjqknlmoprust#vw5yz}{|~ c|&|OKOKO|*||+####    5 O0!#O ")#&$%'(*-+,|./|1@293645%&78 :=;<O>?AHBECDOFG|ILJKMNPoQ`RYSVTU5WX,Z][\^_|ahbecdOfgiljk,mn!pqxrust#vw|y|z{}~|-aO.DcityJgeoname_id(EEnamesBenGBoxfordIcontinentDcodeBEU _r, BdeFEuropaBenFEuropeBes GBfr QBjaOヨーロッパEpt-BR GBruLЕвропаEzh-CNF欧洲Gcountry (5Tis_in_european_unionHiso_codeBGB BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス u Bru\Великобритания F英国HlocationOaccuracy_radiusdHlatitudeh@IIlongitudehItime_zoneMEurope/LondonFpostal 3COX1Rregistered_country . BFR BdeJFrankreichBenFFranceBesGFranciaBfr!BjaUフランス共和国 uGFrançaBruNФранция F法国Lsubdivisions _ CENG BenGEnglandBesJInglaterraBfrJAngleterre u"w 2a CWBK BenNWest BerkshireBru]Западный Беркшир L西伯克郡 ( 3BAS _r+ BdeEAsienBenDAsiaBes#BfrDAsieBjaIアジア uEÁsiaBruHАзия F亚洲  BBT BdeFBhutanBen#WBesFButánBfr#WBjaRブータン王国 uFButãoBruJБутан F不丹!W!a!sh@;!h@V!LAsia/Thimphu!  /U BRO BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア uHRomêniaBruNРумыния L罗马尼亚FtraitsRis_anonymous_proxy  (W BdeFLondonBen$BesGLondresBfr$BjaLロンドン u$BruLЛондон ( 2 !W!ad!sh@IN;6!hfA!!! _e BUS BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 u%BruFСША F美国"J"Y $y ( 2 !W!a!s$!$!!!$"J%k $y ( 2 !W!a !s$!$!!!$"J%k  )j BdeJLinköpingBen%Bfr%BjaXリンシェーピング I林雪平 ( 2 ( BSE BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 uGSuéciaBruLШвеция F瑞典!W!aL!sh@M5Vl!!h@/;6!PEurope/Stockholm! ,T BDE BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 uHAlemanhaBruPГермания F德国"J ( AE BenUÖstergötland CountyBfrWComté d'Östergötland   BdeKChángchūnBenIChangchunBfr'BjaI長春市BruNЧанчунь F长春 ("  BCN BdeEChinaBen'Bes'BfrEChineBjaF中国 u'BruJКитай (!W!ad!sh@E =q!h@_TTɆ!KAsia/Harbin!'"J  B22 BenKJilin Sheng F吉林 (" 8 BPH BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr(BjaXフィリピン共和国 u(BruRФилиппины I菲律宾!W!ay!sh@*!h@^!KAsia/Manila! 3E34021!(Srepresented_country _e BUS $DtypeHmilitary  X$ BenFMiltonBruNМильтон ( 3BNA _r- BdeKNordamerikaBenMNorth AmericaBesRAmérica del NorteBfrQAmérique du NordBjaO北アメリカ uQAmérica do NorteBru]Северная Америка I北美洲 $!W!a!sh@G*0!h^'RT`Jmetro_code3!SAmerica/Los_Angeles! 3E98354! "J X_ BWA BenJWashingtonBes(BfrSÉtat de WashingtonBjaRワシントン州BruRВашингтон L华盛顿州 (" e BJP BdeEJapanBen(KBesFJapónBfrEJaponBjaF日本 uFJapãoBruLЯпония (m!W!ad!sh@A׹`H!h@axP3:!JAsia/Tokyo!(9 (" A BKR BdeNRepublik KoreaBenKSouth KoreaBesTCorea, República deBfrMCorée du SudBjaL大韓民国 uVCoréia, República daBruUЮжная Корея F韩国!W!ad!sh@B!h@_!JAsia/Seoul!( (" t BTW BdeFTaiwanBen(BesGTaiwánBfrGTaïwanBjaF台湾 u(BruNТайвань (!W!ad!sh@8!h@^@!KAsia/Taipei!( ("  BCN Bde'BenZPeople's Republic of ChinaBesXRepública Popular ChinaBfr(Bja( u'Bru(( (!W!ad!sh@A!h@Z@!(4 (" R BHK BdeHHongkongBenIHong KongBes(Bfr(BjaF香港 u(BruNГонконг (!W!ad!sh@6@!h@\[!NAsia/Hong_Kong!( ( 2 / BNO BdeHNorwegenBenFNorwayBesGNoruegaBfrHNorvègeBjaUノルウェー王国 u(BruPНорвегия F挪威!W!ad!sh@O!h@$!KEurope/Oslo!(Z (" ~ BIL BdeFIsraelBen(Bes(BfrGIsraëlBjaRイスラエル国 u(BruNИзраиль I以色列!W!ad!sh@?!h@A`!NAsia/Jerusalem!( ( 2 !!W!ad!sh@G!h@!LEurope/Paris!! ( 2 ( BCH BdeGSchweizBenKSwitzerlandBesESuizaBfrFSuisseBjaOスイス連邦 uGSuíçaBruRШвейцария F瑞士!W!ad!sh@G>-b9!h@ Ne!MEurope/Zurich!( ( 2 &!W!ad!sh@O!h@.!&!& (" m BBH BdeGBahrainBen(BesHBahréinBfrHBahreïnBjaOバーレーン u(BruNБахрейн F巴林!W!ad!sh@:!h@I@!LAsia/Bahrain!( ( 2 Z BRU BdeHRusslandBenFRussiaBesERusiaBfrFRussieBjaIロシア uGRússiaBruLРоссия I俄罗斯!W!ad!sh@N!h@Y!( f ( 2  /P BPL BdeEPolenBenFPolandBesGPoloniaBfrGPologneBjaXポーランド共和国 uHPolôniaBruLПольша F波兰!W!ad!sh@J!h@4!MEurope/Warsaw!( ( 2 &!W!ad!sh@I!h@%!MEurope/Berlin!& ( 2 0s BIT BdeGItalienBenEItalyBesFItaliaBfrFItalieBjaUイタリア共和国 uGItáliaBruLИталия I意大利!W!ad!sh@EjcI!h@):э&!KEurope/Rome!( ( 2  - BFI BdeHFinnlandBenGFinlandBesIFinlandiaBfrHFinlandeBja[フィンランド共和国 uJFinlândiaBruRФинляндия F芬兰!W!ad!sh@P!h@:!OEurope/Helsinki!( ( 2  @ BBY BdeMWeißrusslandBenGBelarusBesKBielorrusiaBfrLBiélorussieBjaXベラルーシ共和国 uMBielo-RússiaBruPБеларусь L白俄罗斯!W!ad!sh@J!h@<!LEurope/Minsk!( c ( 2 . BCZ BdeUTschechische RepublikBenNCzech RepublicBesPRepública ChecaBfrITchéquieBjaRチェコ共和国 u( uBru]Чешская Республика O捷克共和国!W!ad!sh@H!h@.!MEurope/Prague!( 4 ("  BIR BdeZIran (Islamische Republik)BenDIranBes\Irán (República Islámica)Bfr]Iran (République islamique de)Bja]イラン・イスラム共和国 u\República Islâmica do IrãBruHИран X伊朗伊斯兰共和国!W!ad!sh@@!h@J!KAsia/Tehran!(! ( 2  g BUA BdeGUkraineBen(OBesGUcraniaBfr(OBjaXウクライナ共和国 uHUcrâniaBruNУкраина I乌克兰!W!ad!sh@H!h@@!(= ( 2 !W!ad!sh@Ka7!htr!!! ( 2  BHU BdeFUngarnBenGHungaryBesHHungríaBfrGHongrieBjaXハンガリー共和国 uGHungriaBruNВенгрия I匈牙利!W!ad!sh@G!h@4!OEurope/Budapest!( ( 2!W!ad!sh@HXq`l !h@"GX:S!LEurope/Vaduz ( 2 &O BES BdeGSpanienBenESpainBesGEspañaBfrGEspagneBjaLスペイン uGEspanhaBruNИспания I西班牙!W!ad!sh@D!h!( ( 2  . BBG BdeIBulgarienBenHBulgariaBes(BfrHBulgarieBjaXブルガリア共和国 uIBulgáriaBruPБолгария L保加利亚!W!ad!sh@E!h@9!LEurope/Sofia!( ( 2 #!W!ad!sh@G!h@9!PEurope/Bucharest!# ( 2 *¹ BBE BdeGBelgienBenGBelgiumBesHBélgicaBfrHBelgiqueBjaRベルギー王国 u(BruNБельгия I比利时!W!ad!sh@IjcI!h@!OEurope/Brussels!( (" + BTR BdeGTürkeiBenFTurkeyBesHTurquíaBfrGTurquieBjaRトルコ共和国 uGTurquiaBruLТурция I土耳其!W!ad!sh@C!h@AtU!OEurope/Istanbul!(J ( 2 *s BAT BdeKÖsterreichBenGAustriaBes(!BfrHAutricheBja[オーストリア共和国 uHÁustriaBruNАвстрия I奥地利!W!ad!sh@GcI!h@*:э&!MEurope/Vienna!( ( 2  BAL BdeHAlbanienBenGAlbaniaBes(BfrGAlbanieBjaXアルバニア共和国 uHAlbâniaBruNАлбания O阿尔巴尼亚!W!ad!sh@D!h@4!MEurope/Tirane!( (" & BLB BdeGLibanonBenGLebanonBesGLíbanoBfrELibanBjaUレバノン共和国 u(BruJЛиван I黎巴嫩!W!ad!sh@@ꪎcI!h@AꪎcI!KAsia/Beirut!(w ( 2 ) BNL BdeKNiederlandeBenKNetherlandsBesGHolandaBfrHPays-BasBjaRオランダ王国 uNPaíses BaixosBruTНидерланды F荷兰!W!ad!sh@J@!h@!PEurope/Amsterdam!( (" [ BKW BdeFKuwaitBen(Bes(BfrGKoweïtBjaOクウェート u(BruLКувейт I科威特!W!ad!sh@=!h@G!KAsia/Kuwait!( ("  BSA BdeMSaudi-ArabienBenLSaudi ArabiaBesNArabia SauditaBfrOArabie saouditeBja[サウジアラビア王国 uOArábia SauditaBru]Саудовская Аравия O沙特阿拉伯!W!ad!sh@9!h@F!KAsia/Riyadh!( ( 2 _L BRS BdeGSerbienBenFSerbiaBes(BfrFSerbieBjaLセルビア uGSérviaBruLСербия L塞尔维亚!W!ad!sh@Fh^)!h@4u?h!OEurope/Belgrade!({ ("  BJO BdeIJordanienBen[Hashemite Kingdom of JordanBesHJordaniaBfrHJordanieBja]ヨルダン・ハシミテ王国 uIJordâniaBruPИордания F约旦!W!ad!sh@?!h@B!JAsia/Amman!(# ( 3BAF _r* BdeFAfrikaBenFAfricaBesGÁfricaBfrGAfriqueBjaLアフリカ u(BruLАфрика F非洲 ! BLY Bde]Libysch-Arabische DschamahirijaBenELibyaBesXLibia, República ÁrabeBfrELibyeBja] 社会主義人民リビア・アラブ国 uXLíbia Árabe JamahiriyaBruJЛивия [阿拉伯利比亚民众国!W!ad!sh@<!h@1!NAfrica/Tripoli!(` ( 2 -8 BIE BdeFIrlandBenGIrelandBesURepública de IrlandaBfrGIrlandeBjaRアイルランド uGIrlandaBruPИрландия I爱尔兰!W!ad!sh@J!h !MEurope/Dublin!(q (" l BAZ BdeMAserbaidschanBenJAzerbaijanBesKAzerbaiyánBfrLAzerbaïdjanBja]アゼルバイジャン共和国 uKAzerbaijãoBruVАзербайджан L阿塞拜疆!W!ad!sh@D@!h@G!IAsia/Baku!(6 (" n BAE Bde\Vereinigte Arabische EmirateBenTUnited Arab EmiratesBesWEmiratos Árabes UnidosBfrTÉmirats Arabes UnisBjaXアラブ首長国連邦 uWEmirados Árabes UnidosBru]Объединенные Арабские Эмираты X阿拉伯联合酋长国!W!ad!sh@8!h@K!JAsia/Dubai!( ("  BAM BdeHArmenienBenGArmeniaBes(qBfrHArménieBjaXアルメニア共和国 uHArmêniaBruNАрмения L亚美尼亚!W!ad!sh@D!h@F!LAsia/Yerevan!(S ( 2 (8 BDK BdeIDänemarkBenGDenmarkBesIDinamarcaBfrHDanemarkBjaUデンマーク王国 u(9BruJДания F丹麦!W!ad!sh@L!h@$!QEurope/Copenhagen!( ( 2 .k BIM BdeIInsel ManBenKIsle of ManBesKIsla de ManBfrKÎle de ManBjaIマン島 uKIlha de ManBruMМэн, о-в F曼岛!W!ad!sh@K !h!REurope/Isle_of_Man!( ( 2 $B BGI BdeIGibraltarBen( Bes( Bfr( BjaRジブラルタル u( BruRГибралтар!W!ad!sh@Bɰ!hffffff!PEurope/Gibraltar!( }MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeKGeoIP2-CityKdescriptionBen]*GeoIP2 City Test Database (fake GeoIP2 data, for example purposes only)BzhO小型数据库Jip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Connection-Type-Test.mmdb0000644000175000017500000000730300000000000025140 0ustar00greggreg00000000000000v      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQgRSTUVWXYZ[\]^_`ab{cdexfghijklmnopqrstuvwyz|}~f4      !"#'$%&()*+,-./01235X6G789:;<=>?@ABCDEF)HIJKLMNOPQRSTUVWYZ[\]^_`abcdehijklmnopqrstu`wxyz{|}~``Oconnection_typeFDialup ICable/DSL HCellular ICorporateMaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeVGeoIP2-Connection-TypeKdescriptionBen]5GeoIP2 Connection Type Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Country-Test.mmdb0000644000175000017500000004615700000000000023577 0ustar00greggreg00000000000000js?ssss s s s s sssssssssssssssssss s!s"s#s$s%s&s's(s)s*s+s,s-s.s/s0s1s2s3s4s5s6s7s8s9s:s;s<s=s>s?s@sAsBsCsDsEsFsGsHsIsJsKsLsMsNsOsPsQRsSsTsUsVsWsXsYsZs[s\s]s^s_s`sa!bcdse~fsghssisjsskslsmsnsopssqsrssstusvswsxsysszs{|ss}sssssssssssssssssssssssLsssssssssssssssssss ~sssssssssssssss sssssssssssssssssssssss sssssssssssssssssssss r rsss rs rssssssssssssssssssss sss  s s s ssss sssssssssssssss ssss ss"Gs#$ss%&0'ss(s)s*s+s,s-s.s/ss162s3s4s5ssss78s9s:ss;<s=s>s?ss@sABsCsDssEsFs HIJKxLsMsNqOcPsQsRsSsTsUsVsWsXsYsZs[s\b]s^s_s`sasssssdssesfgshsisjsskslmsnsosspssrssstssuvswssssyzs{s|s}s~sssssssssssssssssssssssssssssss fssssssssssssssssssssssssssssssssssssssssssss$,ssssssssssssssssssssssss4ssssssssssssssssssssAssssssssssssssssss`s s s s s sssssssssssssssssss s!s"s#s$s%s&s's(s)s*s+s,s-s.s/s0s1s2s3s4s5s6s7s8s9s:s;s<s=s>sss@sA8BsCsDsEsFsGsHsIsJsK7sLMsNsOsPsQ,RsS\TsUsVsWsXsYsZs[s`s]s^_`esasbcsdssfgshsisjsk l m n o p q r s t u v w x y z { | } ~                                                                             ss ssssssss  s s ssssssssssss ssssss ssssss ssss ssssss   s s sss ssssssssss s%" s!sFs#s$ss&)'s(ss*s+sss-.ss/s01ss2s3s45s6sss`s9ss:;s<s=s>s?s@sAssBCssDsEF^GWsHsIsJsKLPsMNsOssQTRsSs/sUsVssXYZy[j\c]`^s_ssasbs5sdgesfsBshsisskrlomsns0spsqsssvtsusswsxssz{|}s~sKsssssssssJsss;ssssssJsssssssss5ssssssKssssssYssssssssssssssssssssssss%sssssssssJssssssssssssssssss5ssssssMsssMs ssssss   s sssssssssssssssss ?!0")#&$s%ss's(sMs*-+s,ss.s/s;s18253s4scs6s7ss9<:s;s5s=s>ss@OAHBECsDssFsGs/sILJsKssMsNssPWQTRsSsJsUsVsMsX[YsZss\s]sJs_c`abcrdkehfsgssisjsnslomsns spsqsssztwusvssxsys0s{~|s}ssssnsssssszssssssssssssssssssssssss5sssssssssnssssssDsssssssssssssssssssssssskssssssMsss0s$ssssssssssss ssssss/sss5s  s ss s ssss0sss0sssssss!s ss"s#ss%D&5'.(+)s*ss,s-ss/20s1sYs3s4s!Ks6=7:8s9ss;s<sMs>A?s@ssBsCszsETFMGJHsIs;sKsLssNQOsPsnsRsSs5sU\VYWsXssZs[ss]`^s_sMsasbssdefgzhoiljskssmsnsBspwqtrsss;susvssxsyss{|}s~ssssssssss;ssssssJssssssssssssssssss0sss"sssssssssssssssssssss#sssnsssnsssnssssssssssss0sss5sss0s+ sssssnssssss0sssJssss sss s ss sszsssMssssss0s$!s ss"s#ss%(&s'ss)s*s0s,K-<.5/20s1s5s3s4s#s697s8ss:s;ss=D>A?s@ssBsCssEHFsGs#sIsJssL[MTNQOsPsnsRsSssUXVsWssYsZss\c]`^s_ssasbs$&sdgesfsshsisAsskslsmsnsospqssrssIcontinentDcodeBEUJgeoname_id_r,EnamesBdeFEuropaBenFEuropeBes -Bfr 7BjaOヨーロッパEpt-BR -BruLЕвропаEzh-CNF欧洲Gcountry (5Tis_in_european_unionHiso_codeBGB #BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス [ Bru\Великобритания sF英国Rregistered_country . BFR #BdeJFrankreichBenFFranceBesGFranciaBfr!tBjaUフランス共和国 [GFrançaBruNФранция sF法国  BNA _r- #BdeKNordamerikaBenMNorth AmericaBesRAmérica del NorteBfrQAmérique du NordBjaO北アメリカ [QAmérica do NorteBru]Северная Америка sI北美洲 _e BUS #BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 ["BruFСША sF美国!="  BAS _r+ #BdeEAsienBenDAsiaBes#BfrDAsieBjaIアジア [EÁsiaBruHАзия sF亚洲  BBT #BdeFBhutanBen#iBesFButánBfr#iBjaRブータン王国 [FButãoBruJБутан sF不丹!=  /U BRO #BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア [HRomêniaBruNРумыния sL罗马尼亚FtraitsRis_anonymous_proxy  BNA _r- #Bde!Ben!BesMNorteaméricaBfr"Bja") [";Bru"P s"s Jconfidencec _e BUS #"!= _e BUS #"$>$F Uis_satellite_provider  !="  ( BSE #BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 [GSuéciaBruLШвеция sF瑞典!= ,T BDE #BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 [HAlemanhaBruPГермания sF德国 "  BCN #BdeEChinaBenZPeople's Republic of ChinaBesXRepública Popular ChinaBfrEChineBjaF中国 [&$BruJКитай s&p!=& " $_  BCN #Bde&$Ben&$Bes&$Bfr&gBja&p [&$Bru&~ s&p!=  BCN #& " 8 BPH #BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr' BjaXフィリピン共和国 ['BruRФилиппины sI菲律宾!=&Srepresented_country _e BUS #"DtypeHmilitary$>$F $>$ ! "!=  $B BGI #BdeIGibraltarBen'Bes'Bfr'BjaRジブラルタル ['BruRГибралтар!=' " e BJP #BdeEJapanBen(=BesFJapónBfrEJaponBjaF日本 [FJapãoBruLЯпония s(_!=(+ " A BKR #BdeNRepublik KoreaBenKSouth KoreaBesTCorea, República deBfrMCorée du SudBjaL大韓民国 [VCoréia, República daBruUЮжная Корея sF韩国!=(  $c ( BSE #%!=% " t BTW #BdeFTaiwanBen(uBesGTaiwánBfrGTaïwanBjaF台湾 [(uBruNТайвань s(!=(c " R BHK #BdeHHongkongBenIHong KongBes(Bfr(BjaF香港 [(BruNГонконг s(!=(  / BNO #BdeHNorwegenBenFNorwayBesGNoruegaBfrHNorvègeBjaUノルウェー王国 [(XBruPНорвегия sF挪威!=(0 " ~ BIL #BdeFIsraelBen(Bes(BfrGIsraëlBjaRイスラエル国 [(BruNИзраиль sI以色列!=(  !P!=!P  ( BCH #BdeGSchweizBenKSwitzerlandBesESuizaBfrFSuisseBjaOスイス連邦 [GSuíçaBruRШвейцария sF瑞士!=(5  %!=% " m BBH #BdeGBahrainBen(BesHBahréinBfrHBahreïnBjaOバーレーン [(BruNБахрейн sF巴林!=(  Z BRU #BdeHRusslandBenFRussiaBesERusiaBfrFRussieBjaIロシア [GRússiaBruLРоссия sI俄罗斯!=(=   /P BPL #BdeEPolenBenFPolandBesGPoloniaBfrGPologneBjaXポーランド共和国 [HPolôniaBruLПольша sF波兰!=(  %!=%  0s BIT #BdeGItalienBenEItalyBesFItaliaBfrFItalieBjaUイタリア共和国 [GItáliaBruLИталия sI意大利!=(I   - BFI #BdeHFinnlandBenGFinlandBesIFinlandiaBfrHFinlandeBja[フィンランド共和国 [JFinlândiaBruRФинляндия sF芬兰!=(   @ BBY #BdeMWeißrusslandBenGBelarusBesKBielorrusiaBfrLBiélorussieBjaXベラルーシ共和国 [MBielo-RússiaBruPБеларусь sL白俄罗斯!=(i  . BCZ #BdeUTschechische RepublikBenNCzech RepublicBesPRepública ChecaBfrITchéquieBjaRチェコ共和国 [(OBru]Чешская Республика sO捷克共和国!=( "  BIR #BdeZIran (Islamische Republik)BenDIranBes\Irán (República Islámica)Bfr]Iran (République islamique de)Bja]イラン・イスラム共和国 [\República Islâmica do IrãBruHИран sX伊朗伊斯兰共和国!=(   g BUA #BdeGUkraineBen(BesGUcraniaBfr(BjaXウクライナ共和国 [HUcrâniaBruNУкраина sI乌克兰!=(  !=   BHU #BdeFUngarnBenGHungaryBesHHungríaBfrGHongrieBjaXハンガリー共和国 [GHungriaBruNВенгрия sI匈牙利!=( N  HlocationHlatitudeh@HXq`l Ilongitudeh@"GX:SItime_zoneLEurope/Vaduz  &O BES #BdeGSpanienBenESpainBesGEspañaBfrGEspagneBjaLスペイン [GEspanhaBruNИспания sI西班牙!=( (   . BBG #BdeIBulgarienBenHBulgariaBes( BfrHBulgarieBjaXブルガリア共和国 [IBulgáriaBruPБолгария sL保加利亚!=(  #!=#  *¹ BBE #BdeGBelgienBenGBelgiumBesHBélgicaBfrHBelgiqueBjaRベルギー王国 [( wBruNБельгия sI比利时!=( K " + BTR #BdeGTürkeiBenFTurkeyBesHTurquíaBfrGTurquieBjaRトルコ共和国 [GTurquiaBruLТурция sI土耳其!=(  *s BAT #BdeKÖsterreichBenGAustriaBes( yBfrHAutricheBja[オーストリア共和国 [HÁustriaBruNАвстрия sI奥地利!=( T   BAL #BdeHAlbanienBenGAlbaniaBes( BfrGAlbanieBjaXアルバニア共和国 [HAlbâniaBruNАлбания sO阿尔巴尼亚!=( " & BLB #BdeGLibanonBenGLebanonBesGLíbanoBfrELibanBjaUレバノン共和国 [( BruJЛиван sI黎巴嫩!=( u  ) BNL #BdeKNiederlandeBenKNetherlandsBesGHolandaBfrHPays-BasBjaRオランダ王国 [NPaíses BaixosBruTНидерланды sF荷兰!=( " [ BKW #BdeFKuwaitBen(Bes(BfrGKoweïtBjaOクウェート [(BruLКувейт sI科威特!=( "  BSA #BdeMSaudi-ArabienBenLSaudi ArabiaBesNArabia SauditaBfrOArabie saouditeBja[サウジアラビア王国 [OArábia SauditaBru]Саудовская Аравия sO沙特阿拉伯!=(  _L BRS #BdeGSerbienBenFSerbiaBes(BfrFSerbieBjaLセルビア [GSérviaBruLСербия sL塞尔维亚!=( "  BJO #BdeIJordanienBen[Hashemite Kingdom of JordanBesHJordaniaBfrHJordanieBja]ヨルダン・ハシミテ王国 [IJordâniaBruPИордания sF约旦!=(A  BAF _r* #BdeFAfrikaBenFAfricaBesGÁfricaBfrGAfriqueBjaLアフリカ [(BruLАфрика sF非洲 ! BLY #Bde]Libysch-Arabische DschamahirijaBenELibyaBesXLibia, República ÁrabeBfrELibyeBja] 社会主義人民リビア・アラブ国 [XLíbia Árabe JamahiriyaBruJЛивия s[阿拉伯利比亚民众国!=(T  -8 BIE #BdeFIrlandBenGIrelandBesURepública de IrlandaBfrGIrlandeBjaRアイルランド [GIrlandaBruPИрландия sI爱尔兰!=(7 " l BAZ #BdeMAserbaidschanBenJAzerbaijanBesKAzerbaiyánBfrLAzerbaïdjanBja]アゼルバイジャン共和国 [KAzerbaijãoBruVАзербайджан sL阿塞拜疆!=( " n BAE #Bde\Vereinigte Arabische EmirateBenTUnited Arab EmiratesBesWEmiratos Árabes UnidosBfrTÉmirats Arabes UnisBjaXアラブ首長国連邦 [WEmirados Árabes UnidosBru]Объединенные Арабские Эмираты sX阿拉伯联合酋长国!=( "  BAM #BdeHArmenienBenGArmeniaBes(BfrHArménieBjaXアルメニア共和国 [HArmêniaBruNАрмения sL亚美尼亚!=(  (8 BDK #BdeIDänemarkBenGDenmarkBesIDinamarcaBfrHDanemarkBjaUデンマーク王国 [(SBruJДания sF丹麦!=(%  .k BIM #BdeIInsel ManBenKIsle of ManBesKIsla de ManBfrKÎle de ManBjaIマン島 [KIlha de ManBruMМэн, о-в sF曼岛!=(MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeNGeoIP2-CountryKdescriptionBen]-GeoIP2 Country Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countsKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-DensityIncome-Test.mmdb0000644000175000017500000000577100000000000024703 0ustar00greggreg00000000000000{R      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ RSTUVWXYZ[\]^_`ab{cdexfhgijklmnopqrstuvwyz|}~    ` !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQSTUVWXYZ[\]^z_`abcdoefghijklmn`pqrstuvwxy`|}~Naverage_income~CRpopulation_density `2 =MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeTGeoIP2-DensityIncomeKdescriptionBen]3GeoIP2 DensityIncome Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Domain-Test.mmdb0000644000175000017500000001426600000000000023337 0ustar00greggreg00000000000000*33333_ 3 3 3 3 3333333333333333333 3!3"3#3$3%3&3'3(3)3*3+3,3-3.3/303132333435363738393:3;3<3=3>3?3@3A3B3C3D3E3F3G3H3I3J3K3L3M3N3O3P3QPR3S3T3U3V3W3X3Y3Z3[3\3]3^3_3`3absc3d3epf3g33hi3j3k3l3m3n33oC3q33r33tuKv wx3yz3{|33}~3333333W333333333d3333333d3d33333333q3qq333qqqqqq3q333333333333333333333333333333333333333333W3333W3W333333333333333333333 3 3 3 343&3333333333 3!"3#$%3'33()3*33+3,-33./W301W323W3W35637383933:3;<33=>3?33@AFBCD3E3G3HIJ3LcM3NZ3OP3Q3R3S3T3U33VW3X33Y33[3\3]^3_33`3a3b3d3e33fgu3hi33j3k3lmnopqrs3t33v33wx3y3z3{3|3}3~333333333333333333333333333333333333333333333333333333333333333333333333,3O*33333333333333333333333333333333333333333333333333 33 3333  3 33333333333333333333 3!3"3#33$3%3&'3(3)333+>,3-3.3/330312333343563373893:<3;<<=<3<3?3@A33B3C3DE3F33G3HI33JK3L3M33NS3333Q3R3S3T3U3V3W3X3Y3Z3[3\3]3^3``3a3b3c3d3e3f3g3h3i3j3k3l3m3n3o3p3q3r3s3t3u3v3w3x3y3z3{3|3}3~3333333333333333333333333333333333333333333333333333`3333333333333`3333333333333333333333333333333333333333333333333333333333`33333333333333 3 3 33  3333333333333333333 3!3"3#3$3%3&3'3(3)3n33+3,3-3.3/30133233FdomainKmaxmind.com Inuvox.net Iqwest.net Mspeakeasy.net Lshoesfin.NET Mameritech.net Kpacbell.net Kverizon.net Icovad.net Jpopwifi.it Lin-addr.arpa Ioleane.fr Gbbox.fr Mbredband2.com Stelebecinternet.net Lreplaced.com Scomcastbusiness.net Igol.ne.jp Jsgotti.org Gsfr.netMaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeMGeoIP2-DomainKdescriptionBen],GeoIP2 Domain Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_count3Krecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Enterprise-Test.mmdb0000644000175000017500000001737200000000000024251 0ustar00greggreg00000000000000      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcde~fghijklmnopqrstuvwxyz{|}*,9 ( I ikL 6   / ! "#$%&'()*+,-.012345789:;?<=>@ABCDEFGHIJKMNO[PQRSTUVWXYZ\]^_`abcdefghijlmnopqrstuvwxyz{|}~``     `DcityJconfidence2Jgeoname_id(EEnamesBenGBoxfordIcontinentDcodeBEU _r, #BdeFEuropaBenFEuropeBes TBfr ^BjaOヨーロッパEpt-BR TBruLЕвропаEzh-CNF欧洲Gcountry _ (5Tis_in_european_unionHiso_codeBGB #BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス !Bru\Великобритания F英国HlocationOaccuracy_radiusdHlatitudeh@IIlongitudehItime_zoneMEurope/LondonFpostal @COX1 Rregistered_country . BFR #BdeJFrankreichBenFFranceBesGFranciaBfr" BjaUフランス共和国 GFrançaBruNФранция F法国Lsubdivisions F _ CENG #BenGEnglandBesJInglaterraBfrJAngleterre " 2a CWBK #BenNWest BerkshireBru]Западный Беркшир L西伯克郡 5 @BAS _r+ #BdeEAsienBenDAsiaBes# BfrDAsieBjaIアジア EÁsiaBruHАзия F亚洲 c  BBT #BdeFBhutanBen#tBesFButánBfr#tBjaRブータン王国 FButãoBruJБутан F不丹!h!r!h@;!h@V!LAsia/Thimphu!  /U BRO #BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア HRomêniaBruNРумыния L罗马尼亚FtraitsXautonomous_system_numberŒDFdomainLshoesfin.NETRis_anonymous_proxy CispKLoud PacketLorganizationOzudoarichikito_Iuser_typeTsearch_engine_spider   N #BenGChatham 5 @BNA _r- #BdeKNordamerikaBenMNorth AmericaBesMNorteaméricaBfrQAmérique du NordBjaO北アメリカ QAmérica do NorteBru]Северная Америка I北美洲 c _e BUS #BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 & BruFСША F美国!h!r!h@E,?!hRc{J#:Jmetro_code!PAmerica/New_York! @E12037  ! _e BUS #%"_ ] NA BNY #BdeHNew YorkBen&BesJNueva YorkBfr&BjaUニューヨーク州 KNova IorqueBruOНью-Йорк I纽约州$v$~9O]autonomous_system_organizationXFairPoint CommunicationsOconnection_typeICable/DSL$Hfrpt.net$ Sis_legitimate_proxy Uis_satellite_provider CispXFairpoint Communications$'$Kresidential  * (W #BdeFLondonBen(BesGLondresBfr("BjaLロンドン ("BruLЛондон 5 ? c (5 BGB # !h!rd!h@IN;6!hfA!!! _e BUS #%"_ * _ CENG #"$v'xICorporate$Lin-addr.arpaCispTAndrews & Arnold Ltd$YSTONEHOUSE office network$Jgovernment  3 )j #BdeJLinköpingBen(3Bfr(3BjaXリンシェーピング I林雪平 5 ? c ( BSE #BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 GSuéciaBruLШвеция F瑞典!h!rL!h@M5Vl!!h@/;6!PEurope/Stockholm! ,T BDE #BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 HAlemanhaBruPГермания F德国"_ 3 ( AE #BenUÖstergötland CountyBfrWComté d'Östergötland$v$~sN'?LBredband2 AB'x($Mbredband2.comCisp($FBevtec$(  2  #BdeKChángchūnBenIChangchunBfr(bBjaI長春市BruNЧанчунь F长春 5# _  BCN #BdeEChinaBen(Bes(BfrEChineBjaF中国 (BruJКитай (!h!rd!h@E =q!h@_TTɆ!KAsia/Harbin!  BCN #("_ F  B22 #BenKJilin Sheng F吉林$v$Fdialup 5# _ 8 BPH #BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr(BjaXフィリピン共和国 (BruRФилиппины I菲律宾!h!ry!h@*!h@^!KAsia/Manila! @E34021 ! 8 BPH #(Srepresented_country _e BUS #%DtypeHmilitary$v$ $v'  ( X$ #BenFMiltonBruNМильтон 5 @BNA _r- #Bde%?Ben%NBesRAmérica del NorteBfr%pBja% %Bru% % c _e BUS #%!h!r!h@G*0!h^'RT`&t3!SAmerica/Los_Angeles! @E98354 (! (5 BGB # "_ c X_ BWA #BenJWashingtonBes(BfrSÉtat de WashingtonBjaRワシントン州BruRВашингтон L华盛顿州$v$~'x'CispLCentury Link$OLariat Software$(MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeQGeoIP2-EnterpriseKdescriptionBen]0GeoIP2 Enterprise Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-ISP-Test.mmdb0000644000175000017500000022515600000000000022565 0ustar00greggreg00000000000000 d,      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a bcdefsghiqjklmnop#rRtuvwxyz{|}~   ## # #   ##########3        #   # XXO     t~l9 !"#$%&'(x)X*D+7,1-/.'0'2534''6''8=9;:'<'>A?@''BC''EPFKGIH'J'LNM'O'QTRS'UVW''YhZa[^\]'_'`'bfcd'e''g'isjnklm''op'qr''tuvw''yz{|}~''''''''''''''''''''''''''''''''FFv4                4  4                P -      !" # $ % & ' (  ) * + ,e . / 0  1 23  5867~:Q;<=>?P@ABCDEFGHIJKLMNORS&TUVWX_YZ[\]^_`abcdefghijkumnospqrtuvwxyz{|}~  7 _ v     !!!!!K!d!~     ! jD. !"#$%&!'!()!!*!+,!!-!!/0123456789:;<=>?@ABC"EYFGHIJKLMNOUPQSR"T"VWX"Z[\]^_`abcdefghi"(klmnopqrstu"7v"7wx"7y"7"7z"7{"7|}"7"7~"7"7"7"7"=""""""""""""""""""""#>#X#X#X#X#X#X#X#X#X#X#X#X#X#^##########$V$$$$$     $:$:PB(#! $["$j$%&'$)<*6+1,-./0$:2345$:789:;$:=>?@A$:CFDE$GHIJKML$:NO$:QRSUT$$WzX\Y[Z$$]n^_`fabcde$$ghkij%lm%-opwq%Ers%E%Etu%Ev%E%R%Exy%u%%{|}~%&&,$:$:&A&A&A&A&A&A&A&A&A&A&A&A&A&A&A&A&G&A&A&A"""7"7"7"7"7"7"7"7"7"7"7"7"7"7"7"7"7"7"7&b&&' "' ' ' '5'5' '5'5' ' ' '5'5'5'5'5'5'5'5'5'5'5'5'5'5'5'L'5' ' '5'5' '  ' '5 '5'   (&&&&&&&&&&&&& &!&&"#&$&&%&&'&'r&)l*T+,E-./01243''56C7''89':'';'<'=>'?'@'A''B''D'FGHIJKLMNOPQRS'UV'W'XYZ[\]^_`abcdefghijk'mn' opqrstuvwxy~z|{"}"""""""""""7"7"7"7"7"7"7"7"7"7"7"7"7"7"7'"7&' (;(G(((((((((((((((((     )),{ O!M"#$E%>&8'3(/),*+)B-.)[012)r4567)9:;<=)?@ABCD)FGHIJKL*NPdQRSTUVWXYZ[\]^_`abc*;e*qfghijklmnopqrstuvwxyz*|}~***********+&(+< +c+c+c+c+c+c+c+c+c+c+c+c++c+c++++++++++*, ,     ),U(- , !",,#,,$%,,&,,,,',,(),,,,*+,,,,,,I,,./<0123456789:;,n=N>?@ABC,vD,v,vEF,v,vGH,vI,vJ,v,vK,vL,vM,,vOPQRST,VWXYZz[e\]^_`abcd,foghijklmn,pqrstuvwxy,{|}~,--+-'-0,-@),-L-Y W && %     V'!-g-~-----. .!.<.T .n..."&.#$%.///4/J/_(?)1/y*+.,-/////0/0-~0250630O40g069780000:<1;116=>1M1b1|@H1ABECD1111FG22262RIL2lJ2K22MPNO2223QS3-R3A3]TU3x33WXYqZb[^\]3334_`4(4@/ya4X4lcjdgef444hi4445knlm5.5E5\5vop555rwst5uv56 xy|z{6!6;6W}~6m6666677O7t77778 8-8H78a87t888888988888959m99m9#9::-:@:r::::;;B;f;;;<4>?>y>>><??<?i?<  ????@ =@9@Q @h<   @{   @@@A @AJAnA :r          A    A AA A  A ! "B # $B7 & ' ( ) * + Q , I - . / 6 0 1 2 4 3BQ 5B{ 7 8 B 9 < : ;BB = A > ? @BBB C F D EBC' G HC=C[C{ J K L M N O PC R S Z T U V W X YC [ \ t ] g ^ a _ `C b e c dCC fD% h n i l j kD<DV mD o r p qDD sE! u v ~ w y xED z } { |EfE   E E E  BB F FHFz F   E! F   F   F  G  GUGn  G G G G G G G G GG G      A    G       G           H 4 &    H2    HTHq H  H H H HHH HH HI   II/I[  Iu  III I I II I  I[ I[ I I J)JZ  %    JJ JJK#  K^KK   !  KKKL= " $LT #LkLLI/L ' ( ) * + , - . / 0 1 2 3t 5 6 7  8 9&, : m ; a < D = > ? @ A B C$: E [ F P G H L I J K$: M N O$: Q V R S T U$: W X Y Z$: \ ] ^ _ `$: b c d h e f g$: i j k l$: n o ~ p w q r s t u v$: x y z { | }$:      $:     $:      $: L    L LM M=Mk MM   M  M  M%   N  %N N N7N[$: $:$: $:$: N{$: $:$: $: $:$: $:$: NN            N  (;             N H   7      N    N N    N    N   N N  (  !    N  N " % # $N & 'N ) 2 * - + ,N . 0 /N 1N 3 4 5 6NN 8 9 : ; < = > ? @O A B E C DOO F GO IOA J K L M N O P Q R S VO T UOO X Y  Z [ r \OA ] ^ j _ ` a i b c d e g fO hOOO k l m n o p qP  s t u  v w x y z { |  } ~P9P9 ::  :: :      Pj          PP P P  P P           P  P  Q   Q1       QFQF QF        Q^     t        Qx   Q          Q  Q B 3 !        Q    Q        R  " # $ % & ' ( , ) * +R1 - 0 . /R1 1 2R1 4 A 5 6 7 8 9 : ; < = > ? @RWRWOA C a D V E F G O H I J K L MR NRR P Q R S T UR W X Y Z [ \ ] ^ _ `R1 b c x d o e f g h i j k l m nR p q r s t u v wP y z { | } ~    O         G     R OA            R          R R         QF          S S        S0        P        P               S?      S?          Q Q      O  1  ( ! " # $ % & 'ST ) * + , - . / 0Sk 2 A 3 4 5 7 6 7 8 9 < : ;S = ? >S @Sk B C D E F G H I J K L M NS P Z Q R S T U V W X YS [ q \ i ] ^ _ d ` a b cT& e f g hTT j k l m n o pT r  s t u v w x y z { | }  ~ TT T TT T T T T      T   UUR Uv      U      UU     V)   VN  V   V             V      V     W       W   W   W@WVW{ WWX X; X;X;X;X;X;X;X;Xx   XXXY$  YVYYYYZ7ZdZZZ[C2Z*!ZZ[= ZZ[YZ[oZ"(Z#Z$%Z&Z'ZZ[)ZZ[+Z,Z-Z.Z/[0Z1Z\ZZ34ZZ56ZZ78Z9@:ZZ;Z<Z=Z>Z?\!ZZABZ\_ZDZEFG_HPIZJ\KNZLMZ\\OZZ\QXRZSZTZUZZVWZZ\ZYZZ[]Z\]ZZ^]/Z`jae]?bcZdZ]`ZZfgZhZ]i]ZkrZlZmZnZopZZq]Zs|tyuwvZZ]Zx^ ZzZ{ZZ^D}ZZ~Z^_ZZZ^{ZZ^ZZ^^ZZZ^ZZZ^ZZZZZ]`Z_ ZZZZZZZ_ZZ_?ZZZ_tZZZ_ZZZ_ZZZ_Z_`ZZ]``(`GZ`kZZ`zZ`Z``a a-_%aF     aP !"#$a&<',(+)*a-./0123456789:;a=>^?U@ABCDEFGHIJKLMNOPQRSTaVWXYZ[\]a&`)abcedafghijkb lmno}puqsb rbFtbhbvxwbyzb{|cc>c~c~ccd-dWdddeeVeeef fRfffffgg'gSgogggh:hVhhhii'iQiuiiijjIj_jjjjk k9kjkjkkkllRl~lllm.mpmmmn"nFnlnnno ooOooooop'jl  pg   tt& !"#$%p'(OA*+a,R-D./0123456789:;<=>?@ABCpEFGHIJKLMNOPQHSTUVWXYZ[\]^_`pbncdefghijklmpopqyrstuvwxpz{|}~qq$qEqKqYqoq q    q ]? !"#*$%&'()q+,-.2/01q3456789:;<=>q@JAEBCDrFGHIr%KLMUNOPQRST,VWXYZ[\rQ^_p`abcdefghijklmnoruq}rstuvwxyz{|r~rrssQs!,s+s6s>s[sws     sA+$,n !"#s%&'()*(,=-./0123456789:;<s>?@rBCDEFGHIJKNLMttOPtRhST\UVWXYZ[t)]^b_`atRcdefgtvi{jklwmrnopqtstuvtxyzt|}~uu:,uUuq4uuuuuuuuuuv v#v#v;v#vavpvpvvpvwwwww0   wW  wv,wwww$ "!x%#xT%&)'(xw*+x-./021xx3x567v89k:Z;<=X>S?@RAKBCDEFGHIJyLMNOPQy,yBybTUVWy|Yy[\]^a_`ybcydeyyfgyhyiyjyyylmrHnHoHpqHHz2stuzIwxyz{~|}zpzpzzzzzzzzzzzzz{ {?{_{u{{HHH{||*|N|l|l|||||}}6     }P}Uz6 !"#$%&'()*+/,-.}h012345}h7Q89C:;<=>?@AB}DEFGHIJKLMNOP}RoSaTUVWXYZ[\]^_`bcdefghijklmn}pqrstuvwxy}{|}~}""}}~H~~~~~~~~~~~~~~$~~~$~~~$~"     "(4 !"#$%&'()*+,-./0123~E56789:;<=>?@ABCDEFGqYI|JKLMkNdOZPUQRST~eVWXY~[\]a^_`!Kbc~~efghij~lmnxopqrstuvw yz{|}~''-@?Xr)     Eh}Q> /!"#$%&'+(r)*rr,r-.r01:23456789+&;<=?@ABCDEFGHIJKLMNOPR]STUVWXYZ[\^i_`abcdefghjkxlmnopqrstuvw,yz{N 7} 7]]]]]]]]]]"""""""""""""""""""2 ,Baaz     ) !"#$%&'(*+,-./0134]5Q6789:;E<=>?@ABCDFGHIJKLMNOP-RSTUVWXYZ[\G^h_a`qbcdefgijklmnopqrwstuvx|yz{}~,Qq6[6Y        !"#$%&'()*+`-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcefHghijklmnopqrstuvwxyz{|}~` ,?j BL`q{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{7V{{{{{{a{{{{{{{{{{{{{ {{{ { { { {{{{{{{{{a{{{>{{ 0!{"){#${%{&{'{({{*{{+,{-{.{/{{19{23{{45{6{7{8{{{:;{<{={{?{@{A{B{C{D{E{FG#{{:IJaKLMNOP{QWR{S{T{U{{VE{{XY{Z{[{\{{]^{_{`{R{bcdefghijzklmtnop]qrssuvwxy{|}~]*H\+IIqII{{{{{{{{{{{{{{{{{{ {{   CispZTOT Public Company LimitedLorganization Xautonomous_system_number]autonomous_system_organizationOTelstra Pty LtdCispPTelstra Internet CispVLevel 3 Communications CispJWifiNetComCispGFinecomCisp MCo-Mo ConnectCispMAT&T Services 0jCisp 0jCisp VAT&T Worldnet Services 0G LWHewlett-Packard CompanyCisp!< !CispQvsevolod_artemiev (XCispOrimomeikashite_ (tCispNregõ_kultsár (CispNturner_ménard (CispNhenio_zawadzki (CispHzhu_tang (CispLhakem_asfour (CispOmichael_herring (CispQvaleriya_lazareva (CispKleila_silva (9CispNignacy_sobczak (OCispQsophie_lacharité (hCispLisaac_holmes (CispRChina Unicom Hebei (CispWTaiwan Mobile Co., Ltd. (CispZSavecom International Inc. (Cisp] Digital Pacific Information Technology (CispZBroadband Pacenet Pvt. Ltd (1CispTChina Telecom FUJIAN (VCispVPT Universal Broadband (uCispSSTNet, Incorporated (CispSEhime Catv Co.,ltd. (CispQjeonju university (CispVHong Kong Science Park (CispPUnitech Wireless (CispNWebcentral.com (*Cisp]Bharti Airtel Lanka Pvt. Limited (CCispZChittagong Online Limited. (oCispSGlobal Mobile Corp. (Cisp( LGlobalmobileCisp]China Education and Research Network (Cisp( STsinghua UniversityCisp( ]Shijiazhuang Netdingthing Technology Co.,LtdCispZChangping District,Beijing (OCisp]ChengDu Dr.Peng Telecom & Media Group Industry Co. (tCispWReliance Communications (CispRPT. Mnet Indonesia (CispSPT. Beon Intermedia (CispHINDICLUB (Cisp] Korea Data Telecommunication Co., Ltd. ("CispVChina Telecom SHANGHAI (TCispOUNICOM ZheJiang (uCisp]Jiangsu Electrical Technology Education Center (CispDHCLC (CispQWharf T&T Limited (Cisp]Enterprise of Telecommunications Lao (CispYCallPlus Services Limited ($Cisp\Kuentos Communications, Inc. (HCisp]CMC Telecom Infrastructure Company (oCispYVector Communications Ltd (Cisp]Office des Postes et des Telecomm. de Nouvelle Cal (CispWChina Telecom Guangdong (CispGJNDINFO (!Cisp(! QJND CommunicationCisp CispVSOFTBANK TELECOM Corp. (ZCisp]SANYO Information Technology Solutions Co., Ltd. ({Cisp]Beijing Teletron Telecom Engineering Co., Ltd. (CispWits communications Inc. (CispCNTT CNTTCispRVodafone Australia ("Cisp]Beijing Bosheng Technology Co., Ltd. (?Cisp]KNET Techonlogy (BeiJing) Co.,Ltd. (oCisp]Beijing Bitone United Networks Technology Service (Cisp]Renjiao International Technology Corporation Ltd (Cisp# #Cisp]BeiJing Kuandaitong Telecom Technology Co.,Ltd (!Cisp] Shanghai Yixuan network technology CO.,LTD ([CispXChina Central Television (Cisp]Internet Initiative Japan Inc. (CispUPT. Cyberindo Aditama (CispUK-Opticom Corporation (Cisp]Asia Pacific On-Line Service Inc. (Cisp( ]Asia Pacific Onlie Service Inc.CispWBeiJing NBLLNET Co.,Ltd (vCisp]Beijing Yuexintong Information Technology Company (Cisp( ]Shanghai Xindong Network Co,.Ltd.CispNUNICOM Sichuan (CispMDreamline Co. (CispLeAccess Ltd. (3CispHBit-isle (JCisp]Universitas Negeri Yogyakarta (]CispKAircel Ltd. ZAircel gprs customer DelhiCisp( \Aircel gprs customer KolkataCisp( \Aircel gprs customer ChennaiCisp( ]Aircel gprs customer HyderabadCisp( YAircel GPRS Customer EastCisp( YAircel GPRS Customer WestCisp( ZAircel GPRS Customer SouthCisp]Sliced Tech Holdings Unit Trust (CispZC&M Communication Co.,Ltd. (Cisp]Beijing Gehua Catv Network Co., Ltd. (CispOPT Remala Abadi ( Cisp]Simtronic Technologies Pty Ltd ( 3CispLTata Indicom ( ]CispLFiserv India ( tCispIMobileOne ( CispPU Mobile Sdn Bhd ( CispZHostemo Technology Sdn Bhd ( Cisp]Total Access Communication PLC ( CispKGodaddy.com (! CispSDigicel Pacific Ltd (!CispUMammoth Media Pty Ltd (!=CispWBeagle Internet Pty Ltd (!]CispDKINX (!CispJAMWAYKOREA (!CispUASUSTek COMPUTER INC. (!CispKThe Cavalry (!Cisp]Elementary IT & Communications Ltd (!CispLDrik ICT Ltd ("CispOThree Indonesia ("Cisp]Augere Wireless Broadband Bangladesh Limited ("8Cisp]Elink-space (Beijing) Technology Co,. Ltd ' ("pCisp] Neuviz (PT. Piranti Prestasi Informasi) ("Cisp]Bogor Agricultural University ("CispXPT Sumber Data Indonesia (#CispWVainavi Industries Ltd. (#&Cisp]Universitas Muhammadiyah Malang (#HCispNMeralco Avenue (#sCispTWavecom Wireless Ltd (#CispPUniversitas Riau (#Cisp]Liberty Broadcasting Network Inc. (#Cisp]Meghbela Cable & Broadband Services (P) Ltd (#Cisp] Indusind Media and Communications Ltd. ($*Cisp]Goldfield Industrial Building ($\CispLAndheri East ($CispSRackCentral Pty Ltd ($CispUUnleash Computers Ltd ($CispTWeb Werks India Pvt. ($Cisp]Joint stock Commercial Bank for Foreign Trade of V ($CispNMCS Com Co Ltd (%7Cisp]VentraIP Group (Australia) Pty Ltd (%PCisp[i-System Technology Limited (%~CispZLangham Place Office Tower (% DDigiCispZCmb Taegu Dongbu Broadcast (% ZQuickWeb Hosting SolutionsCispWAirtel Networks Limited (&CispRFawri wilaya Batna (&6CispPAnis wilaya oran (&SCispRAnis wilaya Bechar (&nCispMMaroc Telecom PMaroc Telecom 3GCisp(& (&Cisp(& CIAMCispQSafaricom Limited (&CispIUnitel SA (&CispJMobinil 3G (&Cisp]MTN Business Solutions (Pty) Ltd ('CispOTelkom Internet ('=Cisp$ $Cisp[Airtel Networks Nigeria Ltd ('bCispMEtisalat Misr HEtisalatCisp(' ('CispGVodacom ('CispPAirtel Broadband ('Cisp]Second segment of Broadband IPs ('Cisp]Third segment of Airtel Broadband IPs (( Cisp]Reserved for Internet APN Allocation ((CispUAxtel, S.A.B. de C.V. (>Cisp]Informacion Al Dia Y Comput SA (> UWireless Connect Ltd. FHKTNETCisp]Centro Nacional de Intercambio Automatizado (?2 EF-KOM 0 LXAOL Transit Data NetworkCisp& & PCircle 1 Network IGoversoftCispQCondointernet.net 02, L( 5Cisp( 5 ( 5CispKOi Internet (?Cisp[Regency Comunicações Ltda (@CispWM.A. Informática Ltda. (@(Cisp]Banner Serviços de Telecom e Internet Ltda. (@JCispWHoinaski & Sklasky Ltda (@CispZSilveira & Ziquinatti Ltda (@Cisp]Naja Telecomunicações Ltda. (@Cisp]Eletrosul Centrais Elétricas S.A. (@Cisp]Space Net Serv. De TelecomunicaÇÃo Em Inf. Ltda-me (A Cisp]JF Soluções Informática Ltda. (A`Cisp]Info House Informática e Papeis Ltda (ACispWP3 Host Internet Brasil (ACisp]Bluephone Solucoes Tecnologicas Ltda (ACisp]NETWS Telecomunicações Ltda. (BCisp]Chapeco Tecnologia em Telecomunicações Ltda. (B9Cisp]Afinet Solucoes Em Tecnologia Da Informacao Ltda (BsCispRMil Negocios Ltda. (BCisp]Fox Conect Provedor de Internet LTDA (BCisp]G30 Telecom ServiÇos Em TelecomunicaÇÕes Ltda (BCisp]Midasnet Telecomunicacoes Ltda (C8Cisp]Viveiros & Araujo Serviços de Provedores da Intern (CbCisp] Rodolfo Romao De Oliveira Neto & Cia Ltda (CCisp]Ajaxtel Telecomunicações Ltda. (CCisp] Mcnet Serviços de Comunicações Ltda (DCisp]R.D.S. Bortoluzzi & Cia Ltda - ME (D4CispWTolrs Informática Ltda (DaCisp] Digicontrol ServiÇos De Provedores Ltda (DCisp(D ]Pablo William Silva Tavares de LiraCispXPRIMEHOST do BRASIL Ltda (DCisp]Minas Turbo Provedor de Internet (E CispQBr2 Internet Ltda (E5Cisp]Conexis Internet Provider Ltda - Me (EQCisp]Nolasco & Nonnenmacher Comercio e Rep. Ltda. (ECispZInterneith Via Radio Ltda. (ECisp]Apn - Processamento de Dados e Soluçoes em Interne (ECispQMinas Net Ldta Me (FCisp]Netway Provedor De Internet Ltda (F8Cisp]Catanduva sistemas a cabo ltda. (FdCisp]Telecomunicacões Minas Mais Ltda (FCisp[Bom Tempo Informática Ltda (FCisp\Arikinet Internet Ltda - EPP (FCisp]E&L Producoes de Software Ltda (G CispYMicrofox Informatica Ltda (G3Cisp]Mapfre Vera Cruz Seguradora S/a (GWCisp]Norte Line Telecomunicações Ltda. (GCisp]Predialnet Provedor De Internet Ltda (GCispPPronto Net Ltda. (GCisp]W r de bel entreterimentos s/s ltda (G RIPV6 Internet LtdaCispWAlonso Oliveira Neto Me (HACisp[IP2 Telecomunicação Ltda. (HcCisp]TURBO 10 Telecomunicações Ltda. (HCispDVivo (HCisp[Vcb Provedor De Acesso Ltda (HCisp]Click.com telecomunicações ltda-me (HCisp]Universidade Estadual De Ponta Grossa (ICispTUnica Tecnology Ltda (ILCisp(IL ]Microtell Informatica - Comercio & Prestacao De SCispXT.p.a. InformÁtica Ltda (ICisp]Intercol - Internet Colatina Ltda-ME (ICisp]Sul Americana Tecnologia e Informática Ltda. (ICisp]Ampernet Telecomunicações Ltda (J4Cisp]Mar Provedor de Internet Ltda (J`CispPTim Celular S.A. (JCisp]Jgm Brasil TelecomunicaÇÕes Ltda (JCisp]Inetsafe Comercio De Equipamentos Eletronicos Ltda (JCisp]Infoline - Comunicações e Informações Eletrônicas (KCisp[J W Mateus Informatica - Me (KRCisp[Brasconect Informatica LTDA (KxCisp] Tech Cable do Brasil Sist. de Telec. Ltda (KCisp]Ufla - Universidade Federal De Lavras (KCispYNetprimus Tecnologia Ltda (LCisp[Evanildo Barbeta Boituva ME (L(Cisp]LB Redes Telecomunicações LTDA (LNCispZSidys Comunicações Ltda. (LzCisp[Portalmail Informatica Ltda (LCisp]Internet Pinheirense Ltda - ME (LCispDCTBC (LCisp] Byteweb Comunicação Multimídia Ltda. (LCisp]Redenilf Serviços de Telecomunicações Ltda (M1CispXStar Conect Telecom Ltda (MjCisp]OpçãoNet Informática Ltda ME (MCispRLink Sol LTDA - ME (MCisp] New Master Provedor De Acesso A Internet (MCisp]Gigalink de Nova Friburgo Soluções em Rede Multimi (N 0i L]NTT Communications CorporationCispCNTT CNTT GGPLHost UTrans Canada InternetCispMSmartLabs LLC ]WE Radio Comunicação LTDA EPP YVoax Provedor de Internet KRedeTeleSulCispLCityLink ISP LCityLink Ltd (O Jindtelecom RMitiHost Solutions VFiberXpress DominicanaCispLFIX WIRELESS KHostVDS-NETCispRGolden Lines Cable (O PP.P.H.U Multicom [FOP Molochko Nina Vasilevna FAmdocsCispVVerizon Nederland B.V. (OCisp]Agence Tunisienne Internet - ATI (PCispYSLW Internet Service Ltd. (P3CispUBuckhaven High school (PWCisp]University of Technology, Vienna (Pw YH & M Hennes & Mauritz ABCisp]Egyptian Universities Network (PCispOAB Svenska Spel (P FCDcorp Gw3 GmbHCisp(OCispRForestry Commision (Q CispQWEB Hotel, Moscow (Q=CispUHotel Astoria network (QYCispTSeaside Hotels, S.A. (Qy ]Small Private Enterprise Kvant-II ISevonlineCisp]Rawdat Al-Ma'aref Schools & College (QCispFCASPUR (QCisp]TELECOM ITALIA SPARKLE S.p.A. (R CispYOfficine Informatiche Srl (R4Cisp]Egyptian National Scientific & Technical Informati (RXCispKTiscali SpA (RCisp]Interoute Communications Limited (RCispRTiscali UK Limited (RCisp\Blackpool Sixth Form College (RCispPAberdeen College (SCispQVerizon Sweden AB (S7Cisp]Egyptian Universities Network (EUN) (SSCispQFrogfoot Networks (SCispLCMC Networks (SCispVGlobal Internet Access (SCispKGkn Chep SA (SCispNWana Corporate (SCispMRwandatel, SA (TCisp(T [Wireless Broadband CustomerCispDMWEB (TCCispXData Pro Business Online (TRCisp(TR ]JHB Waverley MetroEthernet, Hosting and Lease LineCisp] Durban Lease Line and Hosting Zone Range (TCispOZimbabwe Online (TCispFONATEL (UCisp\Al Salam Rotana Hotel- sudan (UCispTUniversite de Bamako (U9CispUAmobia Communications (UXCispLSarl ICOSNET (UxCisp]Allocated to Broad band internet in the following (UCisp]Research and Education Network of Uganda - RENU (UCisp]Association of African Universities (VCispXZimbabwe Open University (V6CispQNigeria Air Force (VYCispPBowen University (VuCisp[University of Dar es Salaam (VCispJYo! Africa (VCispNMTN RwandaCell (VCisp]The Institute for Social Accou (VCispKTribe Hotel (WCispUAccesskenya Group Ltd (W$CispOWananchi Online (WDCispUAfribone - Universite (W^CispIIkatel SA (W~CispVOrange Broadband Kenya (WCispYTelecom Lesotho (PTY) LTD (WCisp(W ]Sub allocation to Lerotholi Polytechnic InstituteCisp(& LMarocTelecomCisp\Communication Solutions Ltd. (X+CispRInternet Solutions (XRCisp]Network assigned to Silver Customers in Luanda, An (XoCispZSwift Global Kenya Limited (XCisp(X RPushMobileMediaSGKCisp] Grindrod Management Services (Pty) Ltd (XCispUZenith Bank Ghana Ltd (Y!CispKFinbank PLC (YACispWCentral Bank of Nigeria (YWCispJSeacom Ltd (YyCispVCairo American College (YCisp]National University of Science and Technology (YCispYBeehive Social Enterprise (YCispYUniversity of Jos Nigeria (Z CispSUniversity of Lagos (Z0CispORT-ADSL-project (ZNCispNFiber Grid Inc (ZhCispUNorth West University (ZCisp\University of the Free State (ZCispPGranite NetworksCispWSilverIP CommunicationsCispWAllo Communications LLC VPremier Communications $" OAlamo Broadband ]Argentina Virtual Networks S.R.L. JDIGINET-NZ PLATELZ Co., Ltd. KLGCNS ChinaCispKYourHomeISP \Lytton Area Wireless SocietyCispPCMS Internet LLC THilite International 0+ 0+CispQComcast - Houston (\ \International Business TimesCispVNet By Net Holding LLC (\GCisp]Nonprofit Partnership for the Development of Finan (\hCispUMoscow Mayor's Office (\CispFSPSNET (\Cisp] COLT Technology Services Group Limited (\CispMSlovanet a.s. (] CispNScan Plus GmbH (]!CispOICM NetServ Ltd (]:CispGAltecomCispZSt Andrew's Primary School (]aCisp[Ufi Army Torch Hub Nuneaton (]Cisp]Glenfall County Primary School (]Cisp\Ashleworth CE Primary School (]Cisp]Saechsische Landesbibliothek - (]CispXDinglewell Infant School (^'CispJVERSIA Ltd (^JCispLnacamar GmbH (^_Cisp]Telefonaktiebolaget L M Ericsson (^vCisp]Network for OAO Megdunarodnyi airport Domodedovo (^CispNJet Multimedia (^CispLMobiFon S.A. (^CispWYork County Council LAN (_CispCONO CONO 0 L]SunGard Availability Services USA 0 L(_BCispYSungard Network Solutions (_t ]Silonet.ca - Your Rural Internet Service Provider 0Cisp(l OLariat SoftwareCispWAlfa-Bank Moscow Russia (_CispPIKS Service GmbHCispTCobweb Solutions Ltd (`$CispNStart Services (`CCispUBasisschool De Zaaier (`\Cisp]AO VNIITEMR(Machinery&Robotics Institute), Moscow (`|CispCSFR CSFR JGIGANET.czCispTTelefonica de Espana (`CispOHotel Benessere (`CispOComunedisalerno (aCisp]Tbilisi Pedagogical University (a)Cisp] Emirates Telecommunications Corporation (aSCispTT-Systems Italia Spa (aCispXBrettenham Infant School (aCisp]Shildon County Primary School (aCispRThe Campion School (aCispZJosca's Preparatory School (bCispUDundonald High School (b3Cisp]Folly Hill County First School (bSCisp]Beauclerc County Infant School (b}Cisp]Holly Lodge County Primary School (bCispYLaleham CE Primary School (bCispUSurrey County Council (bCispZTanfield Lea Junior School (cCisp]Tuddenham CE (VC) Primary School (c=Cisp[West Drayton Primary School (ciCispYWellington Primary School (cCispTBrede Primary School (cCispWGrove CE Primary School (cCispYLongney CE Primary School (cCispXKetton CE Primary School (dCisp] FiberSunucu internet Hizmetleri Ugur Pala (d;Cisp] Radisson Edwardian Hotels - radisson-gw (dp 0 LEJPNIC VConnected Intelligence 0 L(dCispLVECTANT Ltd. (d 0J LYSunrise Communications AG 0# LJZiggo B.V. 0 L]TeliaSonera International Carrier 0& L]Taiwan Fixed Network, Telco and Network Service Provider. 0 LSDigital United Inc. 0G LPTelenor Norge AS 0 L]Cable and Wireless Worldwide plc 0 L]Now maintained by Cable & Wireless Worldwide 0 L l 0D L\HiNet IPv6 Service Network., 0 L" 0 L#* 0 L&[ 0E L&{ 0i L(NL 0& L]New Century InfoComm Tech Co., Ltd. 0E- L]Eastern Broadband Telecom Co.,Ltd 0 L]Nippon Telegraph and Telephone Corporation PF Labs 0_ LVINTERNET MULTIFEED CO. 0` L(g 0 LUKDDI KDDI CORPORATION 0 L]So-net Entertainment Corporation 0& L%t 0 L( 0z LYAkamai International B.V. 0J LYSuddenlink Communications 0 LXHurricane Electric, Inc. 0 LONOVARTIS-DMZ-US 0j L( 0(N LDS.A. 0 L(8 0 LMVodafone GmbH 0 LETELE2 0 L]British Telecommunications plc 0 ( L(V 0 LTPolkomtel Sp. z o.o. 03 L]Telefonica Germany GmbH & Co.OHG 00" L( 0 L[Telekomunikacja Polska S.A. 0 LUTelecom Italia S.p.a. 0 LKOrange S.A. 0 LZSwisscom (Switzerland) Ltd 0 LLTelenet N.V. 01 LQJazz Telecom S.A. 0 L(h 0zf L]Kabel Deutschland Vertrieb und Service GmbH 0# LLEWE TEL GmbH 0< L(, 0  LTTELEFONICA DE ESPANA 08 LUBelgacom regional ASN 0 L]Liberty Global Operations B.V. 0p LVKPN Internet Solutions 0"! LTKoninklijke KPN N.V. 0S LPCableuropa - ONO 0a LJLINKdotNET 0 LBIS 0( LJMWEB-10474MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeJGeoIP2-ISPKdescriptionBen])GeoIP2 ISP Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-Precision-Enterprise-Test.mmdb0000644000175000017500000003612300000000000026175 0ustar00greggreg00000000000000)      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~^  _ mF!       "6#$%&'()*+,-./012345 789:;<=>?@ABCDE?GHIUJKLMNOPQRST5VWXYZ[\]^_`abcdefghijkl5nopqrstuvwxyz{|}~&G,O     > !"#$%&'()*+k-./s0]123V4H56789:;<=>?@AGBCDEFIJKLMNOPQRSTUWXYZ[\^_`abfcdeghijklmnopqrtuvwxyz{|}~~`      !"#$%&'(*+,-./0123456789:;<=F>?@ABCDE`GHIJOKLMN!5!PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~!"`"FtraitsIuser_typeHbusinessIcontinentDcodeBASJgeoname_id_r+EnamesBdeEAsienBenDAsiaBes RBfrDAsieBjaIアジアEpt-BREÁsiaBruHАзияEzh-CNF亚洲GcountryJconfidencec 0Hiso_codeBIR ?BdeZIran (Islamische Republik)BenDIranBesEIránBfr Bja]イラン・イスラム共和国 qDIrãBruHИран X伊朗伊斯兰共和国HlocationOaccuracy_radius2Hlatitudeh@A_pIlongitudeh@I($ xItime_zoneKAsia/TehranRregistered_country 0 BIR ? Xautonomous_system_number¬]autonomous_system_organization]Iran Cell Service and Communication CompanyOconnection_typeHCellularCisp"Lorganization" HcellularDcity < 0 ?BdeIDschankojBenHDzhankoyBruNДжанкой  (BEU 0_r, ?BdeFEuropaBenFEuropeBes"Bfr"BjaOヨーロッパ q"BruLЕвропа F欧洲 P 0 g BUA ?BdeGUkraineBen#BesGUcraniaBfr#BjaXウクライナ共和国 qHUcrâniaBruNУкраина I乌克兰!I!S!eh@FPH!wh@A2C\!QEurope/Simferopol! 0 g BUA ?#Lsubdivisions F 0 B43 ?BdeDKrimBen]Autonomous Republic of CrimeaBfr]République autonome de CriméeBru]Республика Крым !pY!SCrimeaCom South LLC"/ICable/DSLCisp$_"N$_ Kresidential"i 2 0(E ?BenGBoxford " _ 0(5Tis_in_european_union BGB ?BdeWVereinigtes KönigreichBenNUnited KingdomBesKReino UnidoBfrKRoyaume-UniBjaLイギリス q%Bru\Великобритания F英国!I!Sd!eh@I!wh!MEurope/LondonFpostal (COX1 ! 0. $$ BFR ?BdeJFrankreichBenFFranceBesGFranciaBfr%BjaUフランス共和国 qGFrançaBruNФранция F法国# F 0_ CENG ?BenGEnglandBesJInglaterraBfrJAngleterre q&K 02a CWBK ?BenNWest BerkshireBru]Западный Беркшир L西伯克郡! 0 /U$$ BRO ?BdeIRumänienBenGRomaniaBesHRumaníaBfrHRoumanieBjaOルーマニア qHRomêniaBruNРумыния L罗马尼亚 Ris_anonymous_proxy$CispJWifiNetCom !jCispMAT&T Services"NVAT&T Worldnet Services"i 0#) ?BenEYendi  (BAF 0_r* ?BdeFAfrikaBenFAfricaBesGÁfricaBfrGAfriqueBjaLアフリカ q'BruLАфрика F非洲 0# BGH ?BdeEGhanaBen(/Bes(/Bfr(/BjaRガーナ共和国 qDGanaBruHГана F加纳!I!S!eh@"b!wh_o!LAfrica/Accra!(# 0# Q BNP ?BenONorthern Region"i ( 0Q) ?BdeKLos AngelesBen(BesLLos ÁngelesBfr(BjaRロサンゼルス q(BruWЛос-Анджелес I洛杉矶  (BNA 0_r- ?BdeKNordamerikaBenMNorth AmericaBesMNorteaméricaBfrQAmérique du NordBjaO北アメリカ qQAmérica do NorteBru]Северная Америка I北美洲 c 0_e BUS ?BdeCUSABenMUnited StatesBesNEstados UnidosBfrKÉtats-UnisBjaUアメリカ合衆国 q(,BruFСША F美国!I!S!eh@AFs!wh]-VJmetro_code#!SAmerica/Los_Angeles% (E90009 ! 0_e BUS ?(# Z 0Q_ BCA ?BdeKKalifornienBenJCaliforniaBes(BfrJCalifornieBjaXカリフォルニア州 qKCalifórniaBruTКалифорния R加利福尼亚州 !!STowerstream I, Inc."/ICorporateCispMTowerstream I"N( "i ( 0G ?BenGHoustonBfr(BjaRヒューストン q(BruNХьюстон I休斯敦 (P (!I!S!eh@=+a!whW8}H(j!OAmerica/Chicago% (E77002 !(# Z 0HE BTX ?BenETexasBes(Bfr(BjaOテキサス州BruJТехас O德克萨斯州 !!]Qwest Communications Company, LLC"/$uFdomainIqwest.netCispKCenturyLink"N( $"i  0RG+ ?BdeISan JoséBenHSan JoseBes(>Bfr(>BjaLサンノゼ q(>BruOСан-Хосе (P (!I!S!eh@BR<6!wh^yD('!(% (E95131 !(# < 0Q_ BCA ?( !H!TMegaPath Corporation"/$u(Mspeakeasy.netCispISpeakeasy"NOVikco Insurance Jgovernment  ' c 0 BBT ?BdeFBhutanBen(fBesFButánBfr(fBjaRブータン王国 qFButãoBruJБутан F不丹!I!S!eh@;!wh@V!LAsia/Thimphu!& !ŒD(Lshoesfin.NET'E$CispKLoud Packet"NOzudoarichikito_ Tsearch_engine_spider"i 0N ?BenGChatham  (BNA 0_r- ?(^ c 0_e BUS ?(!I!S!eh@E,?!whRc{J#:(!PAmerica/New_York% (E12037 ! 0_e BUS ?(# ] 0NA BNY ?BdeHNew YorkBen(BesJNueva YorkBfr(BjaUニューヨーク州 qKNova IorqueBruOНью-Йорк I纽约州 !9O!XFairPoint Communications"/$u(Hfrpt.net'E$Sis_legitimate_proxy$Uis_satellite_provider$CispXFairpoint Communications"N( $"i * 0(W ?BdeFLondonBen(BesGLondresBfr( BjaLロンドン q( BruLЛондон " c 0(5$$ BGB ?$!I!Sd!eh@IN;6!whfA!%!(# * 0_ CENG ?&< (Lin-addr.arpaCispTAndrews & Arnold Ltd"NYSTONEHOUSE office network (>"i 2 0(W ?( " $!I!S !e( i!w( t!%!(#&) (( "i 3 0)j ?BdeJLinköpingBen( DBfr( DBjaXリンシェーピング I林雪平 " c 0($$ BSE ?BdeHSchwedenBenFSwedenBesFSueciaBfrFSuèdeBjaXスウェーデン王国 qGSuéciaBruLШвеция F瑞典!I!SL!eh@M5Vl!!wh@/;6!PEurope/Stockholm! 0,T$$ BDE ?BdeKDeutschlandBenGGermanyBesHAlemaniaBfrIAllemagneBjaXドイツ連邦共和国 qHAlemanhaBruPГермания F德国# 3 0( AE ?BenUÖstergötland CountyBfrWComté d'Östergötland !sN!LBredband2 AB"/((Mbredband2.comCisp( "NFBevtec (>  "_"i 2 0LQ ?BdeKMinneapolisBen( mBesKMineápolisBfr( mBjaRミネアポリス q( mBruVМиннеаполис R明尼阿波利斯 (P _ 0_e BUS ?BdeCUSABen(Bes(,Bfr(>Bja(M q(,BruFСша (t!I!S!eh@F|JM!whWM?(e!(M% (E55414 ! 0_e BUS ?( # F 0L BMN ?BenIMinnesotaBes( BjaOミネソタ州BruRМиннесота ! !PPrecision AS OrgCispMPrecision ISP"NMPrecision Org"i 2 0 ?BdeQHo-Chi-Minh-StadtBenPHo Chi Minh CityBesRCiudad Ho Chi MinhBfrDHCMVBjaRホーチミン市 qUCidade de Ho Chi MinhBruNХошимин L胡志明市  ' c 0 BVN ?BdeGVietnamBen(Bes(Bfr(BjaLベトナム qGVietnãBruNВьетнам F越南!I!S!eh@%҈p!wh@Z4J!PAsia/Ho_Chi_Minh! 0 BVN ?(# < 0" BSG ?Bde(Ben(.Bes(BBfrFSaigonBja(` q(uBruPХо Ши Мин ( !G!]The Corporation for Financing & Promoting Technology"/$uCisp]The Corporation for Financing and Promoting Techno"NSFPT Telecom Company "i 2 0 ?BdeKChángchūnBenIChangchunBfr(kBjaI長春市BruNЧанчунь F长春  ' _ 0 BCN ?BdeEChinaBen(Bes(BfrEChineBjaF中国 q(BruJКитай (!I!Sd!eh@E =q!wh@_TTɆ!KAsia/Harbin! 0 BCN ?(# F 0 B22 ?BenKJilin Sheng F吉林  Fdialup "NLCityLink Ltd  ' _ 08 BPH ?BdeKPhilippinenBenKPhilippinesBesIFilipinasBfr(BjaXフィリピン共和国 q(BruRФилиппины I菲律宾!I!Sy!eh@*!wh@^!KAsia/Manila% (E34021 ! 08 BPH ?(Srepresented_country 0_e BUS ?(DtypeHmilitary"i  0H?i ?BenJSugar LandBjaUシュガーランド q(BruSШугар-Ленд (P (!I!S!eh@=T!whW =q(j!(M% (E77487 !(# < 0HE BTX ?( !+!]Comcast Cable Communications, LLC"/$u(Scomcastbusiness.netCispPComcast Business"N(  'E$ ($"i ( 0X$ ?BenFMiltonBruNМильтон  (BNA 0_r- ?Bde(bBen(qBesRAmérica del NorteBfr(Bja( q(Bru( ( (!I!S!eh@G*0!wh^'RT`(3!(% (E98354 (! 0(5$$ BGB ?$# c 0X_ BWA ?BenJWashingtonBes(BfrSÉtat de WashingtonBjaRワシントン州BruRВашингтон L华盛顿州 !"/$uCispLCentury Link"NOLariat Software (>  ' _ 0e BJP ?BdeEJapanBen(\BesFJapónBfrEJaponBjaF日本 qFJapãoBruLЯпония (~!I!Sd!eh@A׹`H!wh@axP3:!JAsia/Tokyo! 0e BJP ?(X"i( 3 " ( !I!SL!e( !w( (!( (% (F138 20 !( ;#( (   ' _ 0 BCN ?Bde(BenZPeople's Republic of ChinaBesXRepública Popular ChinaBfr(Bja( q(Bru( (!I!Sd!eh@A!wh@Z@! 0 BCN ?(B " _ 0.$$ BCZ ?BdeUTschechische RepublikBenNCzech RepublicBesPRepública ChecaBfrITchéquieBjaRチェコ共和国 q(Bru]Чешская Республика O捷克共和国!I!Sd!eh@H!wh@.!MEurope/Prague! 0.$$ BCZ ?(MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_type[GeoIP2-Precision-EnterpriseKdescriptionBen]:GeoIP2 Precision Enterprise Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoIP2-User-Count-Test.mmdb0000644000175000017500000001132200000000000024122 0ustar00greggreg00000000000000b{d{{{{, { { { { {{{{{{{{{{{{{{{{{{{ {!{"{#{${%{&{'{({){*{+{,{-{.{/{0{1{2{3{4{5{6{7{8{9{:{;{<{={>{?{@{A{B{C{D{E{F{G{H{I{J{K{L{M{N{O{P{QRkSkTkUkVkWkXkYkZk[k\k]k^k_k`kabcdefgkhijklmnopqrstuvwxyz{|}~kkkkk kkkkkk    kkkkkk k!k"k#k$k%k&k'k(k)k*k+k`-{.{/{0{1{2{3{4{5{6{7{8{9{:{;{<{={>{?{@{A{B{C{D{E{F{G{H{I{J{K{L{M{N{O{P{Q{R{S{T{U{V{W{X{Y{Z{[{\{]{^{_{`{a{b{c{k{e{f{g{h{i{j{k{l{m{n{o{pa{qrs{t{u{vw{xykzk{k|k}k~kkk`k{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{k{{{{{{{{{{{{{{{{$      !"#%C&'()*+,-./0123456789:;<=>?@AB DEFGHIJKLMNOPQ$R$ST$$U$V$W$XY$$Z[$$\]$$^$_`$$0`{{c{d{e{f{gkhik{jk{Gipv6_32Gipv6_48Gipv6_64Gipv4_24Gipv4_32  &  &  &  &                          MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeQGeoIP2-User-CountKdescriptionBen]0GeoIP2 User Count Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countkKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/GeoLite2-ASN-Test.mmdb0000644000175000017500000000614000000000000023126 0ustar00greggreg00000000000000|A      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`ab~cdekfghijlnmopqrstuvwxyz{|}`     !"#$%&'()*+,-./0123456789:;<=>?@BCDjEFGHIJKLMiNOPQRS^TUVWXYZ[\]`_`abcdefgh`klmnopqrstuvwxyz{}~Xautonomous_system_number]autonomous_system_organizationOTelstra Pty Ltd j j MAT&T Services  RMerit Network Inc.  XHurricane Electric, Inc.MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeLGeoLite2-ASNKdescriptionBen]+GeoLite2 ASN Test Database (fake GeoIP2 data, for example purposes only)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-no-ipv4-search-tree.mmdb0000644000175000017500000000115200000000000025470 0ustar00greggreg00000000000000@@@@@@@@ @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@.@/@0@1@2@3@4@5@6@7@8@9@:@;@<@=@>@?@P@F::0/64MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_type]MaxMind DB No IPv4 Search TreeKdescriptionBen \Jip_versionIlanguagesBenJnode_count@Krecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-string-value-entries.mmdb0000644000175000017500000000247500000000000026074 0ustar00greggreg000000000000004(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~K1.1.1.16/28J1.1.1.8/29J1.1.1.4/30J1.1.1.2/31J1.1.1.1/32K1.1.1.32/32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_type]MaxMind DB String Value EntriesKdescriptionBen] MaxMind DB String Value Entries (no maps or arrays as values)Jip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-broken-pointers-24.mmdb0000644000175000017500000000241100000000000026314 0ustar00greggreg000000000000004(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~0:@BipG1.1.1.8BipG1.1.1.4BipG1.1.1.2BipG1.1.1.1BipH1.1.1.32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-broken-search-tree-24.mmdb0000644000175000017500000000242200000000000026655 0ustar00greggreg00000000000000(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~BipH1.1.1.16BipG1.1.1.8BipG1.1.1.4BipG1.1.1.2BipG1.1.1.1BipH1.1.1.32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-decoder.mmdb0000644000175000017500000000616700000000000024371 0ustar00greggreg00000000000000kM      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~----`      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL-NOPQRSTUVWXYjZ[\]^_`abcdefghi``lmnopqrstuvwxyz{|}~-EarrayGbooleanEbytesFdoublehEfloatEint32CmapGuint128Fuint16Fuint32Fuint64Kutf8_string@   * h@Eg?[ *? 6CmapDmapXFarrayX Lutf8_stringXEhello C Md U ] fRunicode! ☯ - ♫ h * 6 C M U ]MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeWMaxMind DB Decoder TestKdescriptionBen])MaxMind DB Decoder Test database - contains every MaxMind DB data typeJip_versionIlanguagesBenJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv4-24.mmdb0000644000175000017500000000242200000000000024057 0ustar00greggreg000000000000004(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~BipH1.1.1.16BipG1.1.1.8BipG1.1.1.4BipG1.1.1.2BipG1.1.1.1BipH1.1.1.32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv4-28.mmdb0000644000175000017500000000266600000000000024075 0ustar00greggreg000000000000004(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~BipH1.1.1.16BipG1.1.1.8BipG1.1.1.4BipG1.1.1.2BipG1.1.1.1BipH1.1.1.32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv4-32.mmdb0000644000175000017500000000313200000000000024055 0ustar00greggreg000000000000004(%  !"#$&')*0+,-./1235I6789C:;<=>?@ABDEFGHJKLMzNOPsQeRSTUVWXYZ[\]^d_`abcfghijklmnopqrtuvwxy{|}~BipH1.1.1.16BipG1.1.1.8BipG1.1.1.4BipG1.1.1.2BipG1.1.1.1BipH1.1.1.32MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv6-24.mmdb0000644000175000017500000000536600000000000024073 0ustar00greggreg00000000000000n6      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ'RSTUVWXYZ[\]^_`awbkcdehfgijlmsnopqrtuvxyz{|}~      !"#$%&()*+,-./012345`789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmopqrstuvwxyz{|}~``BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv6-28.mmdb0000644000175000017500000000622600000000000024073 0ustar00greggreg00000000000000n6      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ'RSTUVWXYZ[\]^_`awbkcdehfgijlmsnopqrtuvxyz{|}~      !"#$%&()*+,-./012345`789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmopqrstuvwxyz{|}~``BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-ipv6-32.mmdb0000644000175000017500000000706600000000000024071 0ustar00greggreg00000000000000n6      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ'RSTUVWXYZ[\]^_`awbkcdehfgijlmsnopqrtuvxyz{|}~      !"#$%&()*+,-./012345`789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmopqrstuvwxyz{|}~``BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-metadata-pointers.mmdb0000644000175000017500000000432200000000000026374 0ustar00greggreg00000000000000G````` ` ` ` ` ``````````````````` `!`"`#`$`%`&`'`(`)`*`+`,`-`.`/`0`1`2`3`4`5`6`7`8`9`:`;`<`=`>`?`@`A`B`C`D`E`F`G`H`I`J`K`L`M`N`O`P`Q`R`S`T`U`V`W`X`Y`Z`[`\`]`^`_```awbkc`d`ehf`g`P`i``jP``lmsn``op`q`r``P`t`u`v`Px`yz``{|}``~```````P```````P````````````````````P`P```````````````P``````P`````````P````````````P````````````````````PPP````````````````````````````````` ` ` ` ` ``````````````````P` `!`"`#`$`%`&`'`(`)`*`+``,-`.`/`0`1<2`3`4P5P6P7P8P9P:P;PPP`=>``?`@A``B`C`DE`F`P``H`I`J`K`LPMNP`OP`MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_type\Lots of pointers in metadataKdescriptionBen \Bes \Bzh \Jip_versionIlanguagesBenBesBzhJnode_countPKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-mixed-24.mmdb0000644000175000017500000000577200000000000024316 0ustar00greggreg00000000000000S      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQDRSTUVWXYZ[\]^_$`abcdefghijklmnopqrstuvwxyz{|}~      !"##%&'()*+,-./0123456789:;<=>5?@AANBC[EFGHIJKLMNOPQR`TUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~``BipJ::1.1.1.16BipI::1.1.1.8BipI::1.1.1.4BipI::1.1.1.2BipI::1.1.1.1BipJ::1.1.1.32BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-mixed-28.mmdb0000644000175000017500000000666700000000000024326 0ustar00greggreg00000000000000S      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQDRSTUVWXYZ[\]^_$`abcdefghijklmnopqrstuvwxyz{|}~      !"##%&'()*+,-./0123456789:;<=>5?@AANBC[EFGHIJKLMNOPQR`TUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~``BipJ::1.1.1.16BipI::1.1.1.8BipI::1.1.1.4BipI::1.1.1.2BipI::1.1.1.1BipJ::1.1.1.32BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-mixed-32.mmdb0000644000175000017500000000756400000000000024316 0ustar00greggreg00000000000000S      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQDRSTUVWXYZ[\]^_$`abcdefghijklmnopqrstuvwxyz{|}~      !"##%&'()*+,-./0123456789:;<=>5?@AANBC[EFGHIJKLMNOPQR`TUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~``BipJ::1.1.1.16BipI::1.1.1.8BipI::1.1.1.4BipI::1.1.1.2BipI::1.1.1.1BipJ::1.1.1.32BipM::1:ffff:ffffBipG::2:0:0BipH::2:0:40BipH::2:0:50BipH::2:0:58MaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_typeDTestKdescriptionBenMTest DatabaseBzhUTest Database ChineseJip_versionIlanguagesBenBzhJnode_countKrecord_size ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1568995458.0 maxminddb-1.5.2/tests/data/test-data/MaxMind-DB-test-nested.mmdb0000644000175000017500000000733200000000000024241 0ustar00greggreg00000000000000=a===) = = = = =================== =!="=#=$=%=&='=(=)=*=+=,=-=.=/=0=1=2=3=4=5=6=7=8=9=:=;=<===>=?=@=A=B=C=D=E=F=G=H=I=J=K=L=M=N=O=P=QR=S=T=U=V=W=X=Y=Z=[=\=]=^=_=`=abc=d=efgx=hi=j=k=l=m=n=o==pq=r=s=t=u=v=w==MyMz={=|=}=~===M===========================M===============================================================================================================  = = = ====================== =!="=#=$=%=&='=(=`*=+=,=-=.=/=0=1=2=3=4=5=6=7=8=9=:=;=<===>=?=@=A=B=C=D=E=F=G=H=I=J=K=L=M=N=O=P=Q=R=S=T=U=V=W=X=Y=Z=[=\=]=^=_=`===b=c=d=e=f=g=h=i=j=k=l=m=n=o=p=q=r=s=t=u=v=w=x=y=z={=|=}=~===============================================================================M===========================`=============`=5================= = = = = =================== =!="=#=$=%=&='=(=)=*=+=,=-=.=/=0=1=2=3=4=M==6=7=8=9=:;==<==Dmap1Dmap2EarrayDmap3AaAbAcMaxMind.com[binary_format_major_version[binary_format_minor_versionKbuild_epoch]z)Mdatabase_type]MaxMind DB Nested Data StructuresKdescriptionBen]@MaxMind DB Nested Data Structures Test database - contains deeply nested map/array structuresJip_versionIlanguagesBenJnode_count=Krecord_size././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1547072504.0 maxminddb-1.5.2/tests/data/test-data/maps-with-pointers.raw0000644000175000017500000000007300000000000023603 0ustar00greggreg00000000000000Hlong_keyKlong_value1 Klong_value2Ilong_key2 &  2././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1569616296.0 maxminddb-1.5.2/tests/decoder_test.py0000644000175000017500000002035300000000000017540 0ustar00greggreg00000000000000#!/usr/bin/env python # -*- coding: utf-8 -*- from __future__ import unicode_literals import mmap import sys from maxminddb.compat import byte_from_int, int_from_byte from maxminddb.decoder import Decoder import unittest if sys.version_info[0] == 2: unittest.TestCase.assertRaisesRegex = unittest.TestCase.assertRaisesRegexp unittest.TestCase.assertRegex = unittest.TestCase.assertRegexpMatches class TestDecoder(unittest.TestCase): def test_arrays(self): arrays = { b'\x00\x04': [], b'\x01\x04\x43\x46\x6f\x6f': ['Foo'], b'\x02\x04\x43\x46\x6f\x6f\x43\xe4\xba\xba': ['Foo', '人'], } self.validate_type_decoding('arrays', arrays) def test_boolean(self): booleans = { b"\x00\x07": False, b"\x01\x07": True, } self.validate_type_decoding('booleans', booleans) def test_double(self): doubles = { b"\x68\x00\x00\x00\x00\x00\x00\x00\x00": 0.0, b"\x68\x3F\xE0\x00\x00\x00\x00\x00\x00": 0.5, b"\x68\x40\x09\x21\xFB\x54\x44\x2E\xEA": 3.14159265359, b"\x68\x40\x5E\xC0\x00\x00\x00\x00\x00": 123.0, b"\x68\x41\xD0\x00\x00\x00\x07\xF8\xF4": 1073741824.12457, b"\x68\xBF\xE0\x00\x00\x00\x00\x00\x00": -0.5, b"\x68\xC0\x09\x21\xFB\x54\x44\x2E\xEA": -3.14159265359, b"\x68\xC1\xD0\x00\x00\x00\x07\xF8\xF4": -1073741824.12457, } self.validate_type_decoding('double', doubles) def test_float(self): floats = { b"\x04\x08\x00\x00\x00\x00": 0.0, b"\x04\x08\x3F\x80\x00\x00": 1.0, b"\x04\x08\x3F\x8C\xCC\xCD": 1.1, b"\x04\x08\x40\x48\xF5\xC3": 3.14, b"\x04\x08\x46\x1C\x3F\xF6": 9999.99, b"\x04\x08\xBF\x80\x00\x00": -1.0, b"\x04\x08\xBF\x8C\xCC\xCD": -1.1, b"\x04\x08\xC0\x48\xF5\xC3": -3.14, b"\x04\x08\xC6\x1C\x3F\xF6": -9999.99 } self.validate_type_decoding('float', floats) def test_int32(self): int32 = { b"\x00\x01": 0, b"\x04\x01\xff\xff\xff\xff": -1, b"\x01\x01\xff": 255, b"\x04\x01\xff\xff\xff\x01": -255, b"\x02\x01\x01\xf4": 500, b"\x04\x01\xff\xff\xfe\x0c": -500, b"\x02\x01\xff\xff": 65535, b"\x04\x01\xff\xff\x00\x01": -65535, b"\x03\x01\xff\xff\xff": 16777215, b"\x04\x01\xff\x00\x00\x01": -16777215, b"\x04\x01\x7f\xff\xff\xff": 2147483647, b"\x04\x01\x80\x00\x00\x01": -2147483647, } self.validate_type_decoding('int32', int32) def test_map(self): maps = { b'\xe0': {}, b'\xe1\x42\x65\x6e\x43\x46\x6f\x6f': { 'en': 'Foo' }, b'\xe2\x42\x65\x6e\x43\x46\x6f\x6f\x42\x7a\x68\x43\xe4\xba\xba': { 'en': 'Foo', 'zh': '人' }, (b'\xe1\x44\x6e\x61\x6d\x65\xe2\x42\x65\x6e' b'\x43\x46\x6f\x6f\x42\x7a\x68\x43\xe4\xba\xba'): { 'name': { 'en': 'Foo', 'zh': '人' } }, (b'\xe1\x49\x6c\x61\x6e\x67\x75\x61\x67\x65\x73' b'\x02\x04\x42\x65\x6e\x42\x7a\x68'): { 'languages': ['en', 'zh'] }, } self.validate_type_decoding('maps', maps) def test_pointer(self): pointers = { b'\x20\x00': 0, b'\x20\x05': 5, b'\x20\x0a': 10, b'\x23\xff': 1023, b'\x28\x03\xc9': 3017, b'\x2f\xf7\xfb': 524283, b'\x2f\xff\xff': 526335, b'\x37\xf7\xf7\xfe': 134217726, b'\x37\xff\xff\xff': 134744063, b'\x38\x7f\xff\xff\xff': 2147483647, b'\x38\xff\xff\xff\xff': 4294967295, } self.validate_type_decoding('pointers', pointers) strings = { b"\x40": '', b"\x41\x31": '1', b"\x43\xE4\xBA\xBA": '人', (b"\x5b\x31\x32\x33\x34" b"\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35" b"\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35\x36\x37"): '123456789012345678901234567', (b"\x5c\x31\x32\x33\x34" b"\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35" b"\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35\x36" b"\x37\x38"): '1234567890123456789012345678', (b"\x5d\x00\x31\x32\x33" b"\x34\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34" b"\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35" b"\x36\x37\x38\x39"): '12345678901234567890123456789', (b"\x5d\x01\x31\x32\x33" b"\x34\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34" b"\x35\x36\x37\x38\x39\x30\x31\x32\x33\x34\x35" b"\x36\x37\x38\x39\x30"): '123456789012345678901234567890', b'\x5e\x00\xd7' + 500 * b'\x78': 'x' * 500, b'\x5e\x06\xb3' + 2000 * b'\x78': 'x' * 2000, b'\x5f\x00\x10\x53' + 70000 * b'\x78': 'x' * 70000, } def test_string(self): self.validate_type_decoding('string', self.strings) def test_byte(self): # Python 2.6 doesn't support dictionary comprehension b = dict((byte_from_int(0xc0 ^ int_from_byte(k[0])) + k[1:], v.encode('utf-8')) for k, v in self.strings.items()) self.validate_type_decoding('byte', b) def test_uint16(self): uint16 = { b"\xa0": 0, b"\xa1\xff": 255, b"\xa2\x01\xf4": 500, b"\xa2\x2a\x78": 10872, b"\xa2\xff\xff": 65535, } self.validate_type_decoding('uint16', uint16) def test_uint32(self): uint32 = { b"\xc0": 0, b"\xc1\xff": 255, b"\xc2\x01\xf4": 500, b"\xc2\x2a\x78": 10872, b"\xc2\xff\xff": 65535, b"\xc3\xff\xff\xff": 16777215, b"\xc4\xff\xff\xff\xff": 4294967295, } self.validate_type_decoding('uint32', uint32) def generate_large_uint(self, bits): ctrl_byte = b'\x02' if bits == 64 else b'\x03' uints = { b'\x00' + ctrl_byte: 0, b'\x02' + ctrl_byte + b'\x01\xf4': 500, b'\x02' + ctrl_byte + b'\x2a\x78': 10872, } for power in range(bits // 8 + 1): expected = 2**(8 * power) - 1 input = byte_from_int(power) + ctrl_byte + (b'\xff' * power) uints[input] = expected return uints def test_uint64(self): self.validate_type_decoding('uint64', self.generate_large_uint(64)) def test_uint128(self): self.validate_type_decoding('uint128', self.generate_large_uint(128)) def validate_type_decoding(self, type, tests): for input, expected in tests.items(): self.check_decoding(type, input, expected) def check_decoding(self, type, input, expected, name=None): name = name or expected db = mmap.mmap(-1, len(input)) db.write(input) decoder = Decoder(db, pointer_test=True) ( actual, _, ) = decoder.decode(0) if type in ('float', 'double'): self.assertAlmostEqual(expected, actual, places=3, msg=type) else: self.assertEqual(expected, actual, type) def test_real_pointers(self): with open('tests/data/test-data/maps-with-pointers.raw', 'r+b') as db_file: mm = mmap.mmap(db_file.fileno(), 0) decoder = Decoder(mm, 0) self.assertEqual(({ 'long_key': 'long_value1' }, 22), decoder.decode(0)) self.assertEqual(({ 'long_key': 'long_value2' }, 37), decoder.decode(22)) self.assertEqual(({ 'long_key2': 'long_value1' }, 50), decoder.decode(37)) self.assertEqual(({ 'long_key2': 'long_value2' }, 55), decoder.decode(50)) self.assertEqual(({ 'long_key': 'long_value1' }, 57), decoder.decode(55)) self.assertEqual(({ 'long_key2': 'long_value2' }, 59), decoder.decode(57)) mm.close() ././@PaxHeader0000000000000000000000000000002600000000000011453 xustar000000000000000022 mtime=1576019420.0 maxminddb-1.5.2/tests/reader_test.py0000644000175000017500000005054000000000000017376 0ustar00greggreg00000000000000#!/usr/bin/env python # -*- coding: utf-8 -*- from __future__ import unicode_literals import ipaddress import os import sys import threading from multiprocessing import Process, Pipe import mock import maxminddb try: import maxminddb.extension except ImportError: maxminddb.extension = None from maxminddb import open_database, InvalidDatabaseError from maxminddb.compat import FileNotFoundError from maxminddb.const import (MODE_AUTO, MODE_MMAP_EXT, MODE_MMAP, MODE_FILE, MODE_MEMORY, MODE_FD) if sys.version_info[:2] == (2, 6): import unittest2 as unittest else: import unittest if sys.version_info[0] == 2: unittest.TestCase.assertRaisesRegex = unittest.TestCase.assertRaisesRegexp unittest.TestCase.assertRegex = unittest.TestCase.assertRegexpMatches def get_reader_from_file_descriptor(filepath, mode): """Patches open_database() for class TestFDReader().""" if mode == MODE_FD: with open(filepath, 'rb') as mmdb_fh: return maxminddb.open_database(mmdb_fh, mode) else: # There are a few cases where mode is statically defined in # BaseTestReader(). In those cases just call an unpatched # open_database() with a string path. return maxminddb.open_database(filepath, mode) class BaseTestReader(object): use_ip_objects = False def ipf(self, ip): if self.use_ip_objects: return ipaddress.ip_address(ip) return ip def test_reader(self): for record_size in [24, 28, 32]: for ip_version in [4, 6]: file_name = ('tests/data/test-data/MaxMind-DB-test-ipv' + str(ip_version) + '-' + str(record_size) + '.mmdb') reader = open_database(file_name, self.mode) self._check_metadata(reader, ip_version, record_size) if ip_version == 4: self._check_ip_v4(reader, file_name) else: self._check_ip_v6(reader, file_name) reader.close() def test_get_with_prefix_len(self): decoder_record = { "array": [1, 2, 3], "boolean": True, "bytes": b'\x00\x00\x00*', "double": 42.123456, "float": 1.100000023841858, "int32": -268435456, "map": { "mapX": { "arrayX": [7, 8, 9], "utf8_stringX": "hello", }, }, "uint128": 1329227995784915872903807060280344576, "uint16": 0x64, "uint32": 0x10000000, "uint64": 0x1000000000000000, "utf8_string": "unicode! ☯ - ♫", } tests = [{ 'ip': '1.1.1.1', 'file_name': 'MaxMind-DB-test-ipv6-32.mmdb', 'expected_prefix_len': 8, 'expected_record': None, }, { 'ip': '::1:ffff:ffff', 'file_name': 'MaxMind-DB-test-ipv6-24.mmdb', 'expected_prefix_len': 128, 'expected_record': { "ip": "::1:ffff:ffff" }, }, { 'ip': '::2:0:1', 'file_name': 'MaxMind-DB-test-ipv6-24.mmdb', 'expected_prefix_len': 122, 'expected_record': { "ip": "::2:0:0" }, }, { 'ip': '1.1.1.1', 'file_name': 'MaxMind-DB-test-ipv4-24.mmdb', 'expected_prefix_len': 32, 'expected_record': { "ip": "1.1.1.1" }, }, { 'ip': '1.1.1.3', 'file_name': 'MaxMind-DB-test-ipv4-24.mmdb', 'expected_prefix_len': 31, 'expected_record': { "ip": "1.1.1.2" }, }, { 'ip': '1.1.1.3', 'file_name': 'MaxMind-DB-test-decoder.mmdb', 'expected_prefix_len': 24, 'expected_record': decoder_record, }, { 'ip': '::ffff:1.1.1.128', 'file_name': 'MaxMind-DB-test-decoder.mmdb', 'expected_prefix_len': 120, 'expected_record': decoder_record, }, { 'ip': '::1.1.1.128', 'file_name': 'MaxMind-DB-test-decoder.mmdb', 'expected_prefix_len': 120, 'expected_record': decoder_record, }, { 'ip': '200.0.2.1', 'file_name': 'MaxMind-DB-no-ipv4-search-tree.mmdb', 'expected_prefix_len': 0, 'expected_record': "::0/64", }, { 'ip': '::200.0.2.1', 'file_name': 'MaxMind-DB-no-ipv4-search-tree.mmdb', 'expected_prefix_len': 64, 'expected_record': "::0/64", }, { 'ip': '0:0:0:0:ffff:ffff:ffff:ffff', 'file_name': 'MaxMind-DB-no-ipv4-search-tree.mmdb', 'expected_prefix_len': 64, 'expected_record': "::0/64", }, { 'ip': 'ef00::', 'file_name': 'MaxMind-DB-no-ipv4-search-tree.mmdb', 'expected_prefix_len': 1, 'expected_record': None, }] for test in tests: with open_database('tests/data/test-data/' + test['file_name'], self.mode) as reader: (record, prefix_len) = reader.get_with_prefix_len(test['ip']) self.assertEqual( prefix_len, test['expected_prefix_len'], 'expected prefix_len of {} for {} in {} but got {}'.format( test['expected_prefix_len'], test['ip'], test['file_name'], prefix_len)) self.assertEqual( record, test['expected_record'], 'expected_record for ' + test['ip'] + ' in ' + test['file_name']) def test_decoder(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) record = reader.get(self.ipf('::1.1.1.0')) self.assertEqual(record['array'], [1, 2, 3]) self.assertEqual(record['boolean'], True) self.assertEqual(record['bytes'], bytearray(b'\x00\x00\x00*')) self.assertEqual(record['double'], 42.123456) self.assertAlmostEqual(record['float'], 1.1) self.assertEqual(record['int32'], -268435456) self.assertEqual( { 'mapX': { 'arrayX': [7, 8, 9], 'utf8_stringX': 'hello' }, }, record['map']) self.assertEqual(record['uint16'], 100) self.assertEqual(record['uint32'], 268435456) self.assertEqual(record['uint64'], 1152921504606846976) self.assertEqual(record['utf8_string'], 'unicode! ☯ - ♫') self.assertEqual(1329227995784915872903807060280344576, record['uint128']) reader.close() def test_no_ipv4_search_tree(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-no-ipv4-search-tree.mmdb', self.mode) self.assertEqual(reader.get(self.ipf('1.1.1.1')), '::0/64') self.assertEqual(reader.get(self.ipf('192.1.1.1')), '::0/64') reader.close() def test_ipv6_address_in_ipv4_database(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-ipv4-24.mmdb', self.mode) with self.assertRaisesRegex( ValueError, 'Error looking up 2001::. ' 'You attempted to look up an IPv6 address ' 'in an IPv4-only database'): reader.get(self.ipf('2001::')) reader.close() def test_no_extension_exception(self): real_extension = maxminddb.extension maxminddb.extension = None with self.assertRaisesRegex( ValueError, 'MODE_MMAP_EXT requires the maxminddb.extension module to be available' ): open_database('tests/data/test-data/MaxMind-DB-test-decoder.mmdb', MODE_MMAP_EXT) maxminddb.extension = real_extension def test_broken_database(self): reader = open_database( 'tests/data/test-data/' 'GeoIP2-City-Test-Broken-Double-Format.mmdb', self.mode) with self.assertRaisesRegex( InvalidDatabaseError, r"The MaxMind DB file's data " r"section contains bad data \(unknown data " r"type or corrupt data\)"): reader.get(self.ipf('2001:220::')) reader.close() def test_ip_validation(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) with self.assertRaisesRegex( ValueError, "'not_ip' does not appear to be an IPv4 or " "IPv6 address"): reader.get('not_ip') reader.close() def test_missing_database(self): with self.assertRaisesRegex(FileNotFoundError, "No such file or directory"): open_database('file-does-not-exist.mmdb', self.mode) def test_nondatabase(self): with self.assertRaisesRegex( InvalidDatabaseError, r'Error opening database file \(README.rst\). ' r'Is this a valid MaxMind DB file\?'): open_database('README.rst', self.mode) def test_too_many_constructor_args(self): with self.assertRaises(TypeError): self.readerClass[0]('README.md', self.mode, 1) def test_bad_constructor_mode(self): with self.assertRaisesRegex(ValueError, r'Unsupported open mode \(100\)'): self.readerClass[0]('README.md', mode=100) def test_no_constructor_args(self): with self.assertRaisesRegex( TypeError, r' 1 required positional argument|' r'\(pos 1\) not found|' r'takes at least 2 arguments|' r'function missing required argument \'database\' \(pos 1\)'): self.readerClass[0]() def test_too_many_get_args(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) with self.assertRaises(TypeError): reader.get(self.ipf('1.1.1.1'), 'blah') reader.close() def test_no_get_args(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) with self.assertRaises(TypeError): reader.get() reader.close() def test_incorrect_get_arg_type(self): reader = open_database('tests/data/test-data/GeoIP2-City-Test.mmdb', self.mode) with self.assertRaisesRegex( TypeError, "argument 1 must be a string or ipaddress object"): reader.get(1) reader.close() def test_metadata_args(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) with self.assertRaises(TypeError): reader.metadata('blah') reader.close() def test_metadata_unknown_attribute(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) metadata = reader.metadata() with self.assertRaisesRegex( AttributeError, "'Metadata' object has no " "attribute 'blah'"): metadata.blah reader.close() def test_close(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) reader.close() def test_double_close(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) reader.close() self.assertIsNone(reader.close(), 'Double close does not throw an exception') def test_closed_get(self): if self.mode in [MODE_MEMORY, MODE_FD]: return reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) reader.close() with self.assertRaisesRegex( ValueError, 'Attempt to read from a closed MaxMind DB.|closed'): reader.get(self.ipf('1.1.1.1')) def test_with_statement(self): filename = 'tests/data/test-data/MaxMind-DB-test-ipv4-24.mmdb' with open_database(filename, self.mode) as reader: self._check_ip_v4(reader, filename) self.assertEqual(reader.closed, True) def test_with_statement_close(self): filename = 'tests/data/test-data/MaxMind-DB-test-ipv4-24.mmdb' reader = open_database(filename, self.mode) reader.close() with self.assertRaisesRegex(ValueError, 'Attempt to reopen a closed MaxMind DB'): with reader: pass def test_closed(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) self.assertEqual(reader.closed, False) reader.close() self.assertEqual(reader.closed, True) # XXX - Figure out whether we want to have the same behavior on both the # extension and the pure Python reader. If we do, the pure Python # reader will need to throw an exception or the extension will need # to keep the metadata in memory. def test_closed_metadata(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) reader.close() # The primary purpose of this is to ensure the extension doesn't # segfault try: metadata = reader.metadata() except IOError as ex: self.assertEqual('Attempt to read from a closed MaxMind DB.', str(ex), 'extension throws exception') else: self.assertIsNotNone(metadata, 'pure Python implementation returns value') def test_multiprocessing(self): self._check_concurrency(Process) def test_threading(self): self._check_concurrency(threading.Thread) if sys.version_info[0] == 2: def test_byte_ip_on_python2(self): reader = open_database( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb', self.mode) record = reader.get(b'::1.1.1.0') def _check_concurrency(self, worker_class): reader = open_database('tests/data/test-data/GeoIP2-Domain-Test.mmdb', self.mode) def lookup(pipe): try: for i in range(32): reader.get(self.ipf('65.115.240.{i}'.format(i=i))) pipe.send(1) except: pipe.send(0) finally: if worker_class is Process: reader.close() pipe.close() pipes = [Pipe() for _ in range(32)] procs = [worker_class(target=lookup, args=(c, )) for (p, c) in pipes] for proc in procs: proc.start() for proc in procs: proc.join() reader.close() count = sum([p.recv() for (p, c) in pipes]) self.assertEqual(count, 32, 'expected number of successful lookups') def _check_metadata(self, reader, ip_version, record_size): metadata = reader.metadata() self.assertEqual(2, metadata.binary_format_major_version, 'major version') self.assertEqual(metadata.binary_format_minor_version, 0) self.assertGreater(metadata.build_epoch, 1373571901) self.assertEqual(metadata.database_type, 'Test') self.assertEqual({ 'en': 'Test Database', 'zh': 'Test Database Chinese' }, metadata.description) self.assertEqual(metadata.ip_version, ip_version) self.assertEqual(metadata.languages, ['en', 'zh']) self.assertGreater(metadata.node_count, 36) self.assertEqual(metadata.record_size, record_size) def _check_ip_v4(self, reader, file_name): for i in range(6): address = '1.1.1.' + str(pow(2, i)) self.assertEqual({'ip': address}, reader.get(self.ipf(address)), 'found expected data record for ' + address + ' in ' + file_name) pairs = { '1.1.1.3': '1.1.1.2', '1.1.1.5': '1.1.1.4', '1.1.1.7': '1.1.1.4', '1.1.1.9': '1.1.1.8', '1.1.1.15': '1.1.1.8', '1.1.1.17': '1.1.1.16', '1.1.1.31': '1.1.1.16' } for key_address, value_address in pairs.items(): data = {'ip': value_address} self.assertEqual( data, reader.get(self.ipf(key_address)), 'found expected data record for ' + key_address + ' in ' + file_name) for ip in ['1.1.1.33', '255.254.253.123']: self.assertIsNone(reader.get(self.ipf(ip))) def _check_ip_v6(self, reader, file_name): subnets = [ '::1:ffff:ffff', '::2:0:0', '::2:0:40', '::2:0:50', '::2:0:58' ] for address in subnets: self.assertEqual({'ip': address}, reader.get(self.ipf(address)), 'found expected data record for ' + address + ' in ' + file_name) pairs = { '::2:0:1': '::2:0:0', '::2:0:33': '::2:0:0', '::2:0:39': '::2:0:0', '::2:0:41': '::2:0:40', '::2:0:49': '::2:0:40', '::2:0:52': '::2:0:50', '::2:0:57': '::2:0:50', '::2:0:59': '::2:0:58' } for key_address, value_address in pairs.items(): self.assertEqual({'ip': value_address}, reader.get(self.ipf(key_address)), 'found expected data record for ' + key_address + ' in ' + file_name) for ip in ['1.1.1.33', '255.254.253.123', '89fa::']: self.assertIsNone(reader.get(self.ipf(ip))) def has_maxminddb_extension(): return maxminddb.extension and hasattr(maxminddb.extension, 'Reader') @unittest.skipIf(not has_maxminddb_extension() and not os.environ.get('MM_FORCE_EXT_TESTS'), 'No C extension module found. Skipping tests') class TestExtensionReader(BaseTestReader, unittest.TestCase): mode = MODE_MMAP_EXT if has_maxminddb_extension(): readerClass = [maxminddb.extension.Reader] @unittest.skipIf(not has_maxminddb_extension() and not os.environ.get('MM_FORCE_EXT_TESTS'), 'No C extension module found. Skipping tests') class TestExtensionReaderWithIPObjects(BaseTestReader, unittest.TestCase): mode = MODE_MMAP_EXT use_ip_objects = True if has_maxminddb_extension(): readerClass = [maxminddb.extension.Reader] class TestAutoReader(BaseTestReader, unittest.TestCase): mode = MODE_AUTO if has_maxminddb_extension(): readerClass = [maxminddb.extension.Reader] else: readerClass = [maxminddb.reader.Reader] class TestMMAPReader(BaseTestReader, unittest.TestCase): mode = MODE_MMAP readerClass = [maxminddb.reader.Reader] # We want one pure Python test to use IP objects, it doesn't # really matter which one. class TestMMAPReaderWithIPObjects(BaseTestReader, unittest.TestCase): mode = MODE_MMAP use_ip_objects = True readerClass = [maxminddb.reader.Reader] class TestFileReader(BaseTestReader, unittest.TestCase): mode = MODE_FILE readerClass = [maxminddb.reader.Reader] class TestMemoryReader(BaseTestReader, unittest.TestCase): mode = MODE_MEMORY readerClass = [maxminddb.reader.Reader] class TestFDReader(BaseTestReader, unittest.TestCase): def setUp(self): self.open_database_patcher = mock.patch('reader_test.open_database') self.addCleanup(self.open_database_patcher.stop) self.open_database = self.open_database_patcher.start() self.open_database.side_effect = get_reader_from_file_descriptor mode = MODE_FD readerClass = [maxminddb.reader.Reader] class TestOldReader(unittest.TestCase): def test_old_reader(self): reader = maxminddb.Reader( 'tests/data/test-data/MaxMind-DB-test-decoder.mmdb') record = reader.get('::1.1.1.0') self.assertEqual(record['array'], [1, 2, 3]) reader.close()